Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int dp[n][2];
- for(int i=0;i<n;i++)
- dp[i][0]=dp[i][1]=1;
- int ans=1;
- for(int i=1;i<n;i++)
- for(int j=0;j<i;j++)
- {
- if(arr[i]>arr[j])
- dp[i][0]=max(dp[i][0], 1+dp[j][1]);
- if(arr[j]>arr[i])
- dp[i][1]=max(dp[i][1] , 1+dp[j][0]);
- ans=max(ans,max(dp[i][1] ,dp[i][0]));
- }
- cout<<ans<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement