Submission #1348301

#	Time	Username	Problem	Language	Result	Execution time	Memory
1348301		MunkhturErdenebat	Bigger segments (IZhO19_segments)	C++20	0 / 100	1 ms	344 KiB

segments

#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <iterator>
#include <set>
#include <stdlib.h>
 #define ll long long
 #define fr first
 #define sc second
 #define pb push_back
 #define YES cout<<"YES"<<endl
 #define NO cout<<"NO"<<endl
 #define endl "\n"
using namespace std;
    ll a,b,c,d,e,f,m,i,j,n,h,g,mid,l,r,ka,dp[1000005],t[105005],q[200005],k[200105];
    map<ll,ll> mee,see;
    map<ll,ll> mii,maa;
    vector<ll> vas[200005],ves,vis,vii;
    string x,y,z,te,to;
    pair<ll,string> wefe;
    stack<ll> munkh;
    multiset<ll> mul;

int main(){
    cin>>a;
    for(i=0;i<a ; i++){
        cin>>k[i];
    }
    l=1;
    h=k[0];
    m=1;
    while(l<a){
        g=0;
        r=a+1;
        for(i=l ; i<a ; i++){
            g+=k[i];
            if(g>=h){
                r=i+1;
                break;
            }
        }
        if(r==a+1){
            break;
        }
        for(i=l; i<r ;i++){
            if(h+k[i]<=g-k[i]){
                h+=k[i];
                g-=k[i];
            }
            else{
                break;
            }
        }
        l=r;
        m++;
        h=g;
    }
    cout<<m<<endl;
}

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