제출 #173841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
173841		Trickster	Bigger segments (IZhO19_segments)	C++14	0 / 100	3 ms	380 KiB

segments

#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
#include <map>

#define N 100010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mod 1000000007
#define pii pair <int, int>

using namespace std;

int n;
int ans;
int v[N];
int p[N];

int main()
{
	cin >> n;
	
	for(int i = 1; i <= n; i++)
		cin >> v[i];
	
	for(int i = n; i >= 1; i--) p[i] = p[i+1] + v[i];
	
	int sum = 0;
	int prev = 0;
	queue <int> Q;
	for(int i = 1; i <= n; i++) {
		sum += v[i];
		
		Q.push(i);
		
		if(!Q.empty() && sum >= prev) {
			while(!Q.empty() && ans) {
				if(sum-v[Q.front()] < prev) break;
				
				sum -= v[Q.front()];
				Q.pop();
			}
			
			Q.empty();
			prev = sum, sum = 0;
			
			if(i != n && p[i+1] < prev) break;
			
			ans ++;
		}
	}
	cout << ans;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27