Submission #41543

#	Time	Username	Problem	Language	Result	Execution time	Memory
41543		wzy	지구 온난화 (NOI13_gw)	C++11	0 / 40	630 ms	32768 KiB

gw

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
int ans = 0;
int n;
int v[1000005];
vector<pair<int,int> > cut;
int mark[1000005];
bool removed[1000005];
int main(){
	cin>>n;
	for(int i = 0 ; i < n;i++){
		cin>>v[i];
		mark[i] = 0;
		cut.pb(pair<int,int> ( v[i] , i));
	}
	int maxi = 1;
	sort(cut.begin() , cut.end());
	for(int i = 0 ; i <n ;i ++){
		maxi = max(maxi ,ans);
		int u = cut[i].second;
		removed[u] = true;
		if(mark[u]) ans--;
		if(u){
			mark[u-1]++;
			if(mark[u-1] == 1 && !removed[u-1])
				ans++;
		}
		if(u < n - 1){
			mark[u+1]++;
			if(mark[u+1] == 1 && !removed[u+1]){
				ans++;
			}
		}
		maxi = max(maxi ,ans);
	}
	cout<<maxi<<endl;
}

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