제출 #645839

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

segments

#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>

typedef long long llong;
const int MAXN = 250 + 10;
const int INF  = 1e9;

int a[MAXN], n;
void solve()
{
    int ans = 1;
    int lPtr = 2;
    llong prevSum = a[1], currSum = 0;
    for (int i = 2 ; i <= n ; ++i)
    {
        currSum += a[i];
        if (currSum >= prevSum)
        {
            while (currSum - a[lPtr] >= prevSum)
            {
                currSum -= a[lPtr];
                lPtr++;
            }

            prevSum = currSum;
            currSum = 0;
            lPtr = i+1;
            ans++;
        }
    }

    std::cout << ans << '\n';
}

void read()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }
}

void fastIO()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIO();
    read();
    solve();

    return 0;
}

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