4 solutions
-
-2
#include<bits/stdc++.h> using namespace std; const int N=1e5; int a[N]; int dp[N]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=2;i<=n;i++) { dp[i]=1; for(int j=1;j<i;j++) { if(a[i]>a[j])dp[i]=max(dp[i],dp[j]+1); } } int jishu=0; for(int i=1;i<=n;i++) { jishu=max(dp[i],jishu); } cout<<jishu; return 0; }
Information
- ID
- 975
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 78
- Accepted
- 23
- Uploaded By