제출 #686406

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

segments

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define int long long
#define f first
#define s second
#define pb push_back
#define ld long double
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vec vector

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
const ld eps = 1e-6;
const int mod = 1e9 + 7;
const int oo = 2e9;
const ll OO = 2e18;
const int N = 2e5 + 10;

void solve()
{
    int n;
    cin >> n;
    vec<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    vec<int> bl;
    bl.pb(a[1]);
    int last = 2, sum = 0;
    for (int i = 2; i <= n; i++)
    {
        sum += a[i];
        if (sum >= bl.back())
        {
            while (last < i && bl.back() + a[last] <= sum - a[last])
            {
                sum -= a[last];
                bl.back() += a[last];
                last++;
            }
            bl.pb(sum);
            last = i + 1;
            sum = 0;
        }
    }
    cout << sz(bl);
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}

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