제출 #707736

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

segments

#include<bits/stdc++.h>
using namespace std;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	vector<long long>all(n+1);
	for(int i=1;i<=n;i++){
		cin>>all[i];
	}
	vector<long long>ps(n+1);
	ps[0]=0;
	for(int i=1;i<=n;i++){
		ps[i]=all[i]+ps[i-1];
	}
	long long maxa=0;
	int i=0,j=1;
	int cnt=0;
	while(j<=n){
		if(ps[j]-ps[i]>=maxa){
			cnt++;
			while(maxa+all[i+1]<=ps[j]-ps[i+1]){
				i++;
				maxa+=all[i];
			}
			maxa=ps[j]-ps[i];
			i=j;
			j++;
		}
		else{
			j++;
			continue;
		}
	}
	cout<<cnt<<"\n";
}

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