Submission #769880

#	Time	Username	Problem	Language	Result	Execution time	Memory
769880		Ahmed57	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	316 KiB

segments

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    long long arr[n];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
    }
    long long i = 1 , sum = arr[0] , ans = 1;
    while(i<n){
        long long j = i;
        long long val = 0;
        while(j<n&&val<sum)val+=arr[j++];
        if(val<sum)break;
        ans++;
        while(val-arr[i]>=sum+arr[i]){
            val-=arr[i];sum+=arr[i];
            i++;
        }
        sum = val;i = j;
    }
    cout<<ans<<endl;
    return 0;
}

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