Submission #405797

#TimeUsernameProblemLanguageResultExecution timeMemory
405797fadi57Global Warming (NOI13_gw)C++14
0 / 40
674 ms64040 KiB
#include<bits/stdc++.h> using namespace std; const int mx=1000001; typedef long long ll; int inf=1e9+10; const int mod=1e9+7; int n,m,k; vector<pair<ll,int>>v; vector<pair<ll,ll>>adj[mx]; ll best[mx]; int vis[mx]; ll ans=0; ll a[mx]; int main(){ cin>>n; a[0]=-1; a[n+1]=-1; for(int i=1;i<=n;i++){ cin>>a[i]; v.push_back({a[i],i}); } sort(v.begin(),v.end()); int cur=1; int ans=1; map<int,int>mp; for(int i=0;i<n;i++){ int me=v[i].second; if((a[me+1]>a[me])&&(a[me-1]>a[me])){ cur++; }else if(a[me-1]>a[me]){ mp[me]=1; }else if(a[me-1]==a[me]){ mp[me]=mp[me-1]; if(a[me+1]>a[me]){ cur++; } } ans=max(ans,cur); } cout<<ans; }
#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...