Advertisement
Zinak

Lis

Jul 23rd, 2019
143
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.45 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main()
  4. {
  5.     int n,i,mx,j;
  6.     cin>>n;
  7.     int a[n+5],lis[n+5]={1};
  8.     for(i=0;i<n;i++)
  9.         cin>>a[i];
  10.     i=1,j=0,mx=lis[0];
  11.     while(i<n && j<i)
  12.     {
  13.         if(a[i]>a[j]&& lis[i]<lis[j]+1)
  14.         {
  15.             lis[i]=lis[j]+1;
  16.             j++;
  17.         }
  18.         else
  19.         {
  20.             i++;
  21.         }
  22.         mx=max(mx,lis[i]);
  23.     }
  24.     cout<<mx<<endl;
  25.     return 0;
  26. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement