//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MN = 1e3 + 3;
ll n, a[MN], pref[MN], dp[MN][MN], C[MN][MN], p[MN][MN];
ll f(ll l, ll r, ll i) {
ll a = pref[i] - pref[l - 1];
ll b = pref[r] - pref[i];
return a * b;
}
void bt(int a, int b) {
if(b>n)exit(-1);
cout << b << " ";
if(a>1)
bt(a-1, p[a][b]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], pref[i] = pref[i - 1] + a[i];
ll ans = 0, g = n;
for(int a = 1; a <= k; a++) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= i; j++) {
ll t = dp[a-1][j-1] + f(j, n, i);
dp[a][i] = max(dp[a][i], t);
if(dp[a][i]==t)
p[a][i]=j-1;
}
ans = max(ans, dp[a][i]);
if(ans==dp[a][i]) g=i;
}
}
cout << ans << '\n';
bt(k, g);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Incorrect |
2 ms |
376 KB |
Integer 2 violates the range [1, 1] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
2 ms |
760 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
10 ms |
2552 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
10 ms |
1912 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
12 ms |
2424 KB |
Integer 200 violates the range [1, 199] |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
145 ms |
3576 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
203 ms |
3676 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
166 ms |
3064 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
148 ms |
3720 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
147 ms |
3744 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
37 ms |
1016 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
75 ms |
1656 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Integer 0 violates the range [1, 9999] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
376 KB |
declared answer doesn't correspond to the split scheme: declared = 96, real = 2757000 |
2 |
Halted |
0 ms |
0 KB |
- |