Submission #1201375

#TimeUsernameProblemLanguageResultExecution timeMemory
1201375amanthabandGlobal Warming (CEOI18_glo)C++20
0 / 100
2096 ms2628 KiB
#include <iostream> #include <vector> using namespace std; int solve(vector<int> a,int n ){ vector<int> dp(n,1); for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { if(a[i] > a[j]) dp[i] = max(dp[i],dp[j] +1 ); } } int ans =0; for (int i = 0; i < n; i++) { ans = max(ans,dp[i]); } return ans; } int main(){ int n,x; cin>>n>>x; vector<int> a(n); for (int i = 0; i < n; i++) { cin>>a[i]; } int ans = solve(a,n); cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...