Advertisement
Guest User

Untitled

a guest
Feb 18th, 2019
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.41 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. int h[1010];
  6. int dp[1010];
  7. int main()
  8. {
  9. int n;
  10. scanf("%d",&n);
  11. for(int i=1;i<=n;++i){
  12. scanf("%d",&h[i]);
  13. }
  14. int ans=0;
  15. for(int i=1;i<=n;++i){
  16. for(int j=0;j<i;++j){
  17. if(h[j]<h[i])
  18. dp[i]=max(dp[i],dp[j]+1);
  19. }
  20. ans=max(ans,dp[i]);
  21. }
  22. printf("%d",ans);
  23. return 0;
  24. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement