Submission #1096689

#TimeUsernameProblemLanguageResultExecution timeMemory
1096689nguyenvuGlobal Warming (CEOI18_glo)C++14
0 / 100
2071 ms4696 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl "\n" #define F first #define S second const ll ool=1e18; const int ooi=1e9; const int MOD=1e9+7; const int N=2e5; int n,k; int a[N+5]; ll cnt[N+5]; map <int,int> m; void subtask2() { for (int i=1;i<=n;i++) cnt[i]=1; for (int i=1;i<n;i++) for (int j=i+1;j<=n;j++) if (a[j]>a[i]) cnt[j]=cnt[i]+1; cout<<*max_element(cnt+1,cnt+n+1); } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n>>k; for (int i=1;i<=n;i++) cin>>a[i]; subtask2(); }
#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...