Submission #1167662

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167662		Petrix	Global Warming (NOI13_gw)	C++20	40 / 40	359 ms	9188 KiB

gw

#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;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 7 / 7
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11