제출 #976959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976959		batsukh2006	Separator (CEOI19_separator)	C++17	0 / 100	1 ms	348 KiB

separator

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
#include<bitset>
using namespace std;
 
#define MOD 1000000000
#define int long long
#define ff first
#define ss second
#define endl '\n'
void solve(){
	int n; cin>>n;
	int mx=-1;
	set<int> s;
	vector<int> res(n+1);
	for(int i=1; i<=n; i++){
		int b; cin>>b;
		int a=(res[i-1]+b)%MOD;
		if(a>mx){
			mx=a;
			s.insert(a);
		}
		int sum=s.size(),cnt=0;
		auto it=s.upper_bound(a);
		if(it!=s.end()){
			cnt++;
			it++;
		}
		while(it!=s.end()){
			cnt++;
			s.erase(prev(it++));
		}
		if(mx!=a&&!s.empty()) s.erase(prev(it));
		res[i]=sum-cnt;
	}
	for(int i=1; i<=n; i++){
		cout<<res[i]<<endl;
	}
}
signed main(){
    // freopen("file.in", "r", stdin);
    // freopen("file.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int t=1;
    // cin>>t;
    while(t--){
        solve();
        cout<<endl;
    }
    return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40
• Subtask 4: 0 / 10