//#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());
ll n, a[55], pref[55], dp[55][55][55];
pair<ll, ll> p[55][55][55];
ll f(ll l, ll r, ll i) {
ll a = pref[i] - pref[l - 1];
ll b = pref[r] - pref[i];
return a * b;
}
ll get(ll l, ll r, ll k) {
if (dp[l][r][k] != -1)
return dp[l][r][k];
ll &ans = dp[l][r][k];
ans = 0;
p[l][r][k] = {-1, -1};
for (int spl = l; spl < r; spl++) {
for (int y = 0; y < k; y++) {
ll t = f(l, r, spl) + get(l, spl, y) + get(spl + 1, r, k - y - 1);
ans = max(ans, t);
if (ans == t) {
p[l][r][k] = {spl, y};
}
}
}
return ans;
}
void backtrack(ll l, ll r, ll k) {
if (p[l][r][k].first == -1)
return;
backtrack(l, p[l][r][k].first, p[l][r][k].second);
cout << p[l][r][k].first << " ";
backtrack(p[l][r][k].first + 1, r, k - 1 - p[l][r][k].second);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof dp);
ll k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], pref[i] = pref[i - 1] + a[i];
cout << get(1, n, k) << "\n";
backtrack(1, n, k);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
3 ms |
1784 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
3 ms |
1756 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
3 ms |
1656 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
2936 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
4 ms |
2936 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
184 ms |
2936 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
5 ms |
2936 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
10 ms |
2936 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
7 ms |
2936 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
47 ms |
2908 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
11 ms |
2936 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
7 ms |
2940 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
17 ms |
3064 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
1656 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
1656 KB |
declared answer doesn't correspond to the split scheme: declared = 48, real = 96072 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
1656 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
1656 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |