| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 791474 | adaawf | Feast (NOI19_feast) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
long long int a[305], c[305], f[305][305];
int main() {
int n, k, flag = 0, h = 0, c = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0) {
flag++;
h = i;
}
c[i] = c[i - 1] + a[i];
}
if (flag == 0) {
cout << c[n];
return 0;
}
if (flag == 1) {
if (k >= 2) {
cout << c[n] - a[h];
}
else {
cout << max(c[h - 1], max(c[n] - c[h], c[n]));
}
return 0;
}
}
