제출 #525764

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525764		Alex_tz307	Bigger segments (IZhO19_segments)	C++17	100 / 100	75 ms	12100 KiB

segments

#include <bits/stdc++.h>

using namespace std;

void minSelf(int64_t &x, int64_t y) {
  if (y < x) {
    x = y;
  }
}

void maxSelf(int &x, int y) {
  if (x < y) {
    x = y;
  }
}

void testCase() {
  int n;
  cin >> n;
  vector<int> a(n + 1);
  vector<int64_t> pref(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    pref[i] = pref[i - 1] + a[i];
  }
  vector<int64_t> minSum = pref;
  vector<int> maxSeg(n + 1, 1);
  for (int i = 1; i <= n; ++i) {
    minSelf(minSum[i], minSum[i - 1] + a[i]);
    maxSelf(maxSeg[i], maxSeg[i - 1]);
    int j = distance(pref.begin(), lower_bound(pref.begin() + 1, pref.end(), minSum[i] + pref[i]));
    if (j <= n) {
      maxSeg[j] = maxSeg[i] + 1;
      minSum[j] = pref[j] - pref[i];
    }
  }
  cout << maxSeg[n] << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

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