제출 #876650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876650		Kaztaev_Alisher	Money (IZhO17_money)	C++17	100 / 100	114 ms	15180 KiB

money

#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const ll N = 1e6+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;	

int a[N] , t[N] , n;
void upd(int i){
	for(; i < N; i = (i|(i+1))) t[i]++;
}
int get(int i){
    int res = 0;
    for(; i > 0; i = (i & (i + 1)) - 1) res += t[i];
    return res;
}
int gett(int l , int r){
	if(r < l) return 0;
	return get(r)-get(l-1);
}
void solve(){
	cin >> n;
	for(ll i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int ans = 0;
	for(int i = 1; i <= n; i++){
		int st = i;
		while(a[i] <= a[i+1] && gett(a[st]+1,a[i+1]-1) == 0) i++;
		for(int j = st; j <= i; j++) upd(a[j]);
		ans++;
	}
	cout << ans << "\n";
}
/*

*/
signed main(){
	ios;
	solve();
	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55