제출 #1198428

#제출 시각아이디문제언어결과실행 시간메모리
1198428aykhnBigger segments (IZhO19_segments)C++20
0 / 100
0 ms396 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define inf 0x3F3F3F3F3F3F3F3F

const int MXN = 155;
const int LOG = 30;

void _()
{
  int n;
  cin >> n;
  int a[n];
  for (int &i : a) cin >> i;
  int x = 0, res = 1;
  for (int i = 0; i < n; i++)
  {
    x += a[i];
    int ans = 1;
    for (int j = i + 1, s = 0, y = x; j < n; j++)
    {
      s += a[j];
      if (s >= y) y = s, ans++, s = 0;
    }
    res = max(res, ans);
  }
  cout << res << '\n';
}
signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  // cin >> t;
  while (t--) _();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...