Advertisement
Guest User

Untitled

a guest
Feb 25th, 2017
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.83 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4. int a[20] = {2, 2, 2, 3, 1, 1, 3, 3, 1, 10, 11, 7, 7, 6, 7, 7, 8, 9, 9, 7};
  5. int p[9] = {3, 7, 7, 6, 5, 4, 4, 4, 5};
  6.  
  7. int zadA(int tablica[], int dlugosc);
  8. int zadB(int tablica[], int dlugosc);
  9.  
  10. int main()
  11. {
  12. int licProgow = 0;
  13. licProgow = zadA(a, 20);
  14.  
  15. int maxProgow = 0;
  16. maxProgow = zadB(a, 20);
  17.  
  18. cout << "zadanie a liczba progow: " << licProgow << endl;
  19. cout << "zadanie b najwieksza liczba progow: " << maxProgow << endl;
  20. return 0;
  21. }
  22.  
  23.  
  24. int zadA(int tablica[], int dlugosc){
  25. int progi = 0;
  26. int aktualna = tablica[0];
  27. for(int i=1;i<dlugosc;i++){
  28. //cout << "DEBUG " << aktualna << " " << tablica[i] << endl;
  29. if(aktualna > tablica[i]){
  30. progi++;
  31. }
  32. aktualna = tablica[i];
  33. }
  34. return progi;
  35. }
  36.  
  37. int zadB(int tablica[], int dlugosc){
  38. int maxprogow = 0;
  39. for(int i=0;i<dlugosc;i++){
  40. int schody = 1;
  41. int progi = 0;
  42. int aktualna = tablica[i];
  43. for(int j=i+1;j<dlugosc;j++){
  44. //cout << "AKTUALNA: " << aktualna << ":" << tablica[j] << endl;
  45. if(aktualna >= tablica[j]){
  46.  
  47. schody++;
  48. if(aktualna > tablica[j]){
  49. //cout << "prog: " << aktualna << ":" << tablica[j] << endl;
  50. progi++;
  51. }
  52. }else{
  53. i=j-1;
  54. break;
  55. }
  56. aktualna = tablica[j];
  57. }
  58. if(progi > maxprogow) maxprogow = progi;
  59. //cout << "schody " << schody << endl;
  60. }
  61. //cout << "MAX SCHODOW " << maxprogow<< endl;
  62. return maxprogow;
  63. }
  64.  
  65. //odp do pkt a) 2,2,2 - 3 dlugosc i 0 progow 3,1,1 - 3 dlugosc i 1 progow
  66. // 3,3,1 - 3 dlugosc i 1 progow 11,7,7,6 - 4 dlugosc i 2 progow 7,7 - 2 dlugosc i 0 progow 9,9,7 - 3 dlugosc i 1 progow
  67. //odp do pkt d) n razy
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement