제출 #1167662

#제출 시각아이디문제언어결과실행 시간메모리
1167662Petrix지구 온난화 (NOI13_gw)C++20
40 / 40
359 ms9188 KiB
#include <iostream> #include <algorithm> using namespace std; bool vf[1000001]; int ord[1000001]; int v[1000001]; bool cmp(int a,int b){ return v[a]<v[b]; } int main() { int n,aux=1,rasp=1,i; cin>>n; for(i=1;i<=n;i++){ cin>>v[i];ord[i]=i; } sort(ord+1,ord+n+1,cmp); vf[0]=vf[n+1]=1; for(i=1;i<=n;i++){ int aux1=ord[i]; aux+=1-vf[aux1-1]-vf[aux1+1]; vf[aux1]=1; if(i==n || v[aux1]!=v[ord[i+1]]) rasp=max(rasp,aux); } cout<<rasp; return 0; }
#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...