fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. const long long MaxN = 1e3 + 5;
  4. long long n,a[MaxN], dp[MaxN];
  5. void input()
  6. {
  7.     cin >> n;
  8.     for (long long i=1; i<=n; i++)
  9.     {
  10.         cin >> a[i];
  11.     }
  12. }
  13. void solve()
  14. {
  15.     for (long long i=1; i<=n; i++)
  16.     {
  17.         dp[i]=1; // base case
  18.     }
  19.     long long ans=1;//nếu dãy ban đầu là dãy giảm dần thì mỗi phần tử vẫn là 1 dãy tăng dần nên base ans = 1
  20.     for (long long i=2; i<=n; i++)
  21.     {
  22.         for (long long j=1; j<i; j++)
  23.         {
  24.             if(a[i]>a[j])
  25.             {
  26.                 dp[i]=max(dp[i],dp[j]+1);
  27.             }
  28.         }
  29.         ans=max(ans,dp[i]);
  30.     }
  31.     cout << ans;
  32. }
  33. int main()
  34. {
  35.     ios_base::sync_with_stdio(0);
  36.     cin.tie(0);
  37.     input();
  38.     solve();
  39.     return 0;
  40. }
  41.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1
https://ideone.com/nHzxW5
language:
C++14 (gcc 8.3)
created:
14 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!