Advertisement
Acalia

problema dinamica

Oct 14th, 2019
104
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.60 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4. int l[100];
  5. int main()
  6. {
  7. ifstream in ("date.in");
  8. int n,i,j,m,k;
  9. in>>n;
  10. int a[n];
  11. l[0]=0;
  12. for(i=1;i<=n;i++)
  13. in>>a[i];
  14. l[n]=1;
  15. for(i=n-1;i>=1;i--)
  16. {
  17. m=INT_MAX;
  18. for(j=i+1;j<=n;j++)
  19. {
  20. if(a[i]<=a[j] && a[j]<m)
  21. {
  22. m=a[j];
  23. k=j;
  24. }
  25. }
  26. if(m!=INT_MAX)
  27. l[i]=1+l[k];
  28. else
  29. l[i]=1;
  30. if(l[0]<l[i])
  31. l[0]=l[i];
  32. }
  33. cout<<l[0];
  34.  
  35.  
  36. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement