Submission #1192894

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192894		lopkus	Bigger segments (IZhO19_segments)	C++20	13 / 100	1 ms	328 KiB

segments

#include <bits/stdc++.h>

void solve() {
  int n;
  std::cin >> n;
  std::vector<int64_t> a(n + 1);
  for(int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  std::vector<int64_t> pref(n + 1);
  for(int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] + a[i];
  }
  std::vector<int> dp(n + 1, 0);
  std::vector<int64_t> e(n + 1, 0);
  dp[1] = 1;
  e[1] = a[1];
  for(int i = 2; i <= n; i++) {
    std::pair<int,int> t = {0, 0};
    for(int j = i - 1; j >= 0; j--) {
      if(pref[i] >= pref[j] + e[j]) {
        /**
        if(dp[i] < dp[j] + 1) {
          dp[i] = dp[j] + 1;
          e[i] = pref[i] - pref[j];
        }
        else if(dp[i] == dp[j] + 1) {
          e[i] = std::min(e[i], pref[i] - pref[j]);
        }**/
        t = std::max(t, {dp[j] + 1, pref[j]});
      }
    }
    dp[i] = t.first;
    e[i] = pref[i] - t.second;
  }
  std::cout << dp[n];
}


signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  //std::cin >> t;
  while (t--) {
      solve();
  }

  return 0;
}

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