Advertisement
Guest User

Untitled

a guest
May 22nd, 2018
69
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.95 KB | None | 0 0
  1. #include <iostream>
  2. #define SIZE 12
  3. using namespace std;
  4. int main()
  5. {
  6.     int i;
  7.     int array[SIZE]= {3, 2, 1, 2, 3, 2, 1, 0, 1, 0, 2, 3};
  8. //    int array[SIZE]= {1,2,3,4,5,6,7,8,9,10,11,12};
  9.     int brel = 1, brred = 0, max = 1;//брой елементи на текуща редица, брой редици, дължина на най-дълга редица
  10.     for(i =0 ; i< SIZE-1; i++)
  11.     {
  12.         if(array[i]>array[i+1])
  13.             brel++;
  14.         else
  15.         {
  16.             if(brel!=1)
  17.             {
  18.                 cout<<"descending sequence with legth of "<<brel<<endl;
  19.                 if(brel>max) max=brel;
  20.                 brel = 1;
  21.                 brred++;
  22.             }
  23.         }
  24.     }
  25.     if(max==1)
  26.         cout<<"no descending sequences";
  27.     else
  28.     {
  29.         cout<<"number of descending sequences - "<<brred<<endl;
  30.         cout<<"longest descending sequence with length of "<<max<<endl;
  31.     }
  32.     return 0;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement