oj.uz

답안 #1087434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087434 2024-09-12T17:48:51 Z makrav Bigger segments (IZhO19_segments) C++14
0 / 100
 0 ms 452 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    int last = 0, cs = 0, ans = 0;
    vector<vector<int>> segs;
    int curl = 0;
    for (int i = 0; i < n; i++) {
        cs += a[i];
        if (cs >= last) {
            last = cs;
            segs.pb({curl, i, cs});
            curl = i + 1;
            ans++;
            cs = 0;
        }
    }
    if (cs == 0) {
        cout << ans << '\n';
        return;
    }
    vector<int> pref(n + 1);
    for (int i = 1; i <= n; i++) {
        pref[i] = pref[i - 1] + a[i - 1];
    }
    int LS = 0, LG = 0;
    for (int i = 1; i < sz(segs); i++) {
        int curm = segs[i][0], curr = segs[i][1];
        while (true) {
            if (curm > curr) break;
            if (pref[curr + 1] - pref[curm] >= pref[curm] - pref[LG] && pref[curm] - pref[LG] >= LS) {
                curm++;
            } else break;
        }
        curm--;
        LS = pref[curm] - pref[LG];
        LG = curm;
    }
    if (pref[n] - pref[LG] >= LS) cout << ans + 1 << '\n';
    else cout << ans << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -