제출 #1174100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1174100		nuutsnoynton	지구 온난화 (NOI13_gw)	C++20	12 / 40	892 ms	131072 KiB

gw

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const ll N = 1e6 + 2;
ll ataman[N], cnt;
bool used[N] = {0};
vector < ll > v[N];

ll Get(ll x) {
	if ( x == ataman[x]) return x;
	return ataman[x] = Get(ataman[x]);
}

void Unite(ll x, ll y) {
	x = Get(x);
	y = Get(y);
	if ( x == y) return ;
	cnt --;
	if ( x > y) swap(x, y);
	ataman[y] = x;
	return ;
}



int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n, m, r, x, s, y, i, j, ans, t;

	cin >> n;
	
	ll a[n + 2];
	unordered_map < ll, ll > mp_2;
	set < ll > S;
	for (i = 1; i <= n; i ++) {
		cin >> a[i];
		S.insert(a[i]);
	}
	s = 0;
	
	for ( ll R : S) {
		mp_2[R] = ++s;
	}
	
	for (i = 1; i <= n; i ++) {
		a[i] = mp_2[a[i]];
		v[a[i]].push_back(i);
	}
	
	ans = 0;
	for (i = 1e6; i >= 0; i --) {
		for ( ll X : v[i]) {
			used[X] = 1;
			cnt ++;
			ataman[X] = X;
			if ( used[X - 1] == 1) Unite(X, X - 1);
			if ( used[X + 1] == 1) Unite(X, X + 1);
		}
		ans = max(ans, cnt);
	}
	cout << ans << endl;

}

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