제출 #333644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333644		Dovran	Bigger segments (IZhO19_segments)	C++11	0 / 100	1 ms	364 KiB

segments

#include <bits/stdc++.h>
#define N 500009
#define pii pair <int, int>
#define ff first
#define sz() size()
#define ss second
#define pb push_back
#define ll long long

using namespace std;

int n, v[N];

int main(){
	cin>>n;
	for(int i=0; i<n; i++)
		cin>>v[i];
	ll x=v[0], ans=1, y=0, l=2;
	for(int i=1; i<n; i++){
		y+=v[i];
		if(y>=x){
			while(x+v[l]<=y-v[l]) y-=v[l], l++;
			ans++, x=y, y=0;
		}
	}
	cout<<ans<<' ';
}

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