Submission #1112387

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112387		JelalTkm	Bigger segments (IZhO19_segments)	C++17	13 / 100	3 ms	2384 KiB

segments

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
using namespace std;
 
#define int long long int
 
const int N = 3e5 + 10;
const int md = 1e9 + 7;
const int INF = 1e18;
 
int32_t main(int32_t argc, char *argv[]) {
 
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int T = 1;
  // cin >> T;
  while (T--) {
    int n;
    cin >> n;
    vector<int> a(n + 1), pref(n + 1);
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      pref[i] = pref[i - 1] + a[i];
    }
 
    vector<vector<int>> dp(n + 1, vector<int> (n + 1, INF));
    dp[0][0] = 0;
    int ans = 1;
    for (int i = 1; i <= n; i++) {
      dp[i][1] = pref[i];
      for (int j = 2; j <= i; j++) {
        int l = 0, r = i + 1;
        while (r - l > 1) {
          int mid = (l + r) >> 1;
          if (j - 1 > mid || dp[mid][j - 1] == INF) {
            l = mid;
            continue;
          }          
          if (dp[mid][j - 1] <= pref[i] - pref[mid]) {
            dp[i][j] = min(dp[i][j], pref[i] - pref[mid]);
            l = mid;
          } else r = mid;
        }
 
        if (i == n && dp[i][j] != INF)
          ans = max(ans, j);
      }
    }
 
    cout << ans << '\n';
  }
 
  return 0;
}

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