| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1343739 | ppmn_6 | Bigger segments (IZhO19_segments) | C++20 | 1 ms | 352 KiB |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, cur = 0;
cin >> n;
vector<ll> a(n + 1), cnt(n + 1), val(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
for (int j = cur; j < i; j++) {
if (a[i] - a[j] < val[j]) {
break;
}
cnt[i] = cnt[j] + 1;
val[i] = a[i] - a[j];
cur = j;
}
}
cout << cnt[n];
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
