제출 #96460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96460		rajarshi_basu	지구 온난화 (NOI13_gw)	C++14	12 / 40	1082 ms	16248 KiB

gw

#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <complex>
#include <stack>
#include <set>

#define FOR(i,n) for (int i = 0;i<n;i++)
#define FORE(i, a, b) for (int i = a;i<= b;i++)
#define ll long long int
#define ff first
#define ss second
#define ii pair<int,int>
#define pb push_back
#define mp make_pair

using namespace std;

int* arr;
int N;

// sl == sealevel
int query(int sl){
	int cnt = 0;
	FOR(i,N){
		if(i == 0){
			if(arr[i] > sl){
				cnt++;
			}
		}else{
			if(arr[i] > sl){
				if(arr[i-1] <= sl)cnt++;
			}
		}
	}
	return cnt;
}

int gw(int nn,int *H){
	N = nn;
	ii crdcmprs[N];
	FOR(i,N)crdcmprs[i].ff = H[i],crdcmprs[i].ss = i;
	sort(crdcmprs,crdcmprs+N);
	arr = new int[N];
	int PtR = 0;
	FOR(i,N){
		if(i > 0 and crdcmprs[i].ff > crdcmprs[i-1].ff)PtR++;
		arr[crdcmprs[i].ss] = PtR;

	}
	int mx = 0;
	FOR(i,min(crdcmprs[N-1].ff+1,N+2)){
		mx = max(mx,query(i));
	}
	//cout << mx << endl;
	return mx;
}


int main(){
	int n;
	cin >> n;
	int h[n];
	FOR(i,n)cin >> h[i];
	cout << gw(n,h) << endl;
	return 0;
}

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