Submission #312127

#	Time	Username	Problem	Language	Result	Execution time	Memory
312127		aloo123	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	384 KiB

segments

		#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;

 
const ll INF = 1e12;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;

int a[N];
void solve(){
	int n;
	cin>>n;	
	for(int i =1;i<=n;i++){
		cin>>a[i];
	}
	int s = 0;
	int ans= 0;
	for(int i =1;i<=n;i++){
		// fix i 
		s += a[i];
		int cnt = 0;
		int pre = s;
		int cur = 0;
		int lst = i;
		for(int j = i+1;j<=n;j++){
			cur += a[j];
			if(cur >= pre){
				pre = cur;
				cur = 0;
				cnt++;
				lst = j;
			}
		}
		if(lst == n)
			ans = max(ans,cnt+1);
	}
	cout<<ans<<endl;
}
signed main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
     // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
     ll tt=1;   
     // cin >> tt;
    while(tt--){    
        solve();
    }    
}

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