제출 #342621

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

segments

#include <bits/stdc++.h>

#define fi first
#define se second
#define ll long long
#define dl double long

using namespace std;

const int N = 3e5 + 7;
const long long mod = 1e9 + 7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int main()
{
    ios_base::sync_with_stdio(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );

    int n;
    cin >> n;
    vector < int > a( n + 1 , 0 );
    for( int i = 1; i <= n; i++ ){
        cin >> a[i];
    }
    int ans = 1;
    ll ns = 0;
    ll ps = a[1];
    int ls = 2;
    for( int i = 2; i <= n; i++ ){
        if( ps <= ns ){
            while( ns - 2 * a[ls] >= ps ){
                ns -= a[ls];
                ps += a[ls];
                ls++;
            }
            ps = ns;
            ls = i;
            ans++;
            ns = 0;
            i--;
        }else{
            ns += a[i];
        }
    }
    cout << ans + (ns >= ps);
}

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