제출 #89408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89408		jasony123123	Baloni (COCI15_baloni)	C++11	100 / 100	77 ms	22804 KiB

baloni

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll INF = 1LL << 60;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/*******************************************************/

const int MAXN = 1e6+10;
int N, H[MAXN], cnt[MAXN];

int main(){
	io();
	cin >> N;
	FOR(i,0,N) cin >> H[i];
	int ans = 0;
	FOR(i,0,N){
		if(cnt[H[i]]>0)
			cnt[H[i]]--;
		else
			ans++;
		if(H[i]-1>0)
			cnt[H[i]-1]++;
	}
	cout << ans << "\n";
	return 0;
}

• Subtask 1: 100 / 100