제출 #336304

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

segments

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e6+5;
int n, m, a[N], pref[N];

void solve(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i];
		pref[i] = a[i];
		if(i) pref[i] += pref[i-1];
	}
	int ans = 0;
	for(int i=0;i<n;i++){
		int start = pref[i], last = i, gr = 1;
		//cout<<"0 "<<i<<"\n";
		for(int j=i+1;j<n;j++){
			int l = j;
			while(l < n && pref[l] - pref[last] < start) l++;
			start = pref[l] - pref[last];
			//cout<<last<<" "<<j<<"\n";
			gr++;
			last = l;
			j = l;
		}
		ans = max(ans, gr);
	}
	cout<<ans<<"\n";
	return;
}

signed main(){
	fastios
	int t = 1;
	//cin>>t;
	while(t--) solve();
	return 0;
}
 
 

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