Submission #1160231

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160231		terrifier	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	328 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define niga ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define F first
#define S second
#define sz() size()
#define pb push_back
#define pf push_front
#define all(a) a.begin(), a.end()
#define bll(a) a.rbegin(), a.rend();
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
/*
  a u t h o r (a b a);

──▒▒▒▒▒────▒▒▒▒▒────▒▒▒▒▒────▄████▄─────
─▒─▄▒─▄▒──▒─▄▒─▄▒──▒─▄▒─▄▒──███▄█▀───────
─▒▒▒▒▒▒▒──▒▒▒▒▒▒▒──▒▒▒▒▒▒▒─▐████─────────
─▒▒▒▒▒▒▒──▒▒▒▒▒▒▒──▒▒▒▒▒▒▒──█████▄───────
─▒─▒─▒─▒──▒─▒─▒─▒──▒─▒─▒─▒───▀████▀─────

*/
const ll N = 5e5 + 9, mod =  1e9 + 7, inf = 1e18;
ll a[N];
void solve(){
  ll n;
  cin >> n;
  for (ll i = 1; i <= n; i++)cin >> a[i];
  ll res = 0;
  for (ll i = 1; i <= n; i++){
    ll sum = 0, cnt = 0, last = 0;
    for (ll j = 1; j < i; j++)sum += a[j];
    for (ll j = i; j <= n; j++){
      sum += a[j];
      if (sum >= last){
        cnt++;
        last = sum;
        sum = 0;
      }
    }
    res = max(cnt, res);
  }
  cout << res <<"\n";
}
signed main(){
  niga;
  ll aba = 1;
  // file("name");
  // cin >> aba;
  while (aba --){
    solve();
  }
return 0;
}

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