제출 #490012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
490012		hoanghq2004	Bigger segments (IZhO19_segments)	C++14	100 / 100	111 ms	38468 KiB

segments

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

const int Nmax = 5e5 + 10;

int n;
long long s[Nmax];
vector <int> cands[Nmax];
int f[Nmax];
pair <int, int> best;

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> s[i];
        s[i] += s[i - 1];
    }
    memset(f, -1, sizeof(f));
    f[0] = 0;
    cands[1].push_back(0);
    for (int i = 1; i <= n; ++i) {
        for (auto j: cands[i]) best = max(best, {f[j] + 1, j});
        f[i] = best.first;
        int t = lower_bound(s + 1, s + n + 1, s[i] * 2 - s[best.second]) - s;
        cands[t].push_back(i);
    }
    cout << f[n];
}

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