Submission #1173896

#TimeUsernameProblemLanguageResultExecution timeMemory
1173896ezzzay지구 온난화 (NOI13_gw)C++20
12 / 40
1095 ms5444 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back const int N=3e5+5; int a[N]; signed main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } set<int>st; for(int i=1;i<=n;i++){ st.insert(a[i]); } int p=0; for(auto x:st){ vector<bool>vis(n+1); for(int i=1;i<=n;i++){ if(a[i] >x)vis[i]=1; } int k=0; for(int i=1;i<=n;i++){ if(vis[i] and !vis[i-1])k++; } p=max(p,k); } cout<<p; }
#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...