제출 #1285650

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

segments

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e3+100;
int a[N];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    ll p=0;
    ll ans=0;
    for(int i=1;i<=n;)
    {
        ll sm=a[i];
        int j=i+1;
        while(sm<p and j<=n)
        {
            sm+=a[j];
            j++;
        }
        if(sm<p)
        {
            // no new segment
            break;
        }
        else
        {
            int k=i;
            while(k<j and (p+a[k])<=(sm-a[k]))
            {
                p+=a[k];
                sm-=a[k];
                k++;
            }
            ans++;
            p=sm;
            i=j;
        }
    }
    cout<<ans<<endl;
}

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