#include <bits/stdc++.h>
using namespace std;
#define file if (fopen("input.txt", "r")) { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); }
#define int long long
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
if (s.size()) setIn(s+".in"), setOut(s+".out");
}
const int maxn = 1e5 + 2, maxk = 202;
int a[maxn], prf[maxn], n, k;
namespace Sub2
{
const int s2maxn = 52, s2maxk = 52;
int dp[s2maxn][s2maxn][s2maxk];
int cal(int l, int r, int krem)
{
if (l == r || krem == 0)
return dp[l][r][krem] = 0;
int res = dp[l][r][krem];
if (res != -1)
return res;
res = 0;
for (int i = l; i < r; i++)
{
for (int lk = 0; lk < krem; lk++)
{
int rk = krem - lk - 1;
res = max(res, cal(l, i, lk) + cal(i + 1, r, rk) + (prf[r] - prf[i]) * (prf[i] - prf[l - 1]));
}
}
return dp[l][r][krem] = res;
}
void trace(int l, int r, int krem)
{
bool skip = 0;
for (int i = l; i < r; i++)
{
for (int lk = 0; lk < krem; lk++)
{
int rk = krem - lk - 1;
if (dp[l][r][krem] == cal(l, i, lk) + cal(i + 1, r, rk) + (prf[r] - prf[i]) * (prf[i] - prf[l - 1]))
{
cout << i << ' ';
trace(1, i, lk);
trace(i + 1, r, rk);
skip = 1;
break;
}
}
if (skip)
break;
}
}
void solve()
{
memset(dp, -1, sizeof(dp));
cout << cal(1, n, k) << '\n';
trace(1, n, k);
}
}
namespace Sub4
{
const int s4maxn = 1002, s4maxk = 202;
int dp[s4maxn][s4maxk];
void solve()
{
// dp[0][0] = 0;
memset(dp, -0x3f, sizeof(dp));
dp[0][0] = 0;
k++;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= k; j++)
{
for (int p = 0; p < i; p++)
{
//from n -> i + 1 //from i -> p + 1
dp[i][j] = max(dp[p][j - 1] + (prf[n] - prf[i]) * (prf[i] - prf[p]), dp[i][j]);
}
}
}
cout << dp[n][k] << '\n';
int curk = k, curb = n;
while (curk > 0)
{
for (int i = 0; i < curb; i++)
{
if (dp[i][curk - 1] + (prf[n] - prf[curb]) * (prf[curb] - prf[i]) == dp[curb][curk])
{
if (i)
cout << i << ' ';
curk--;
curb = i;
}
}
}
}
}
namespace Sub5
{
const int s5maxn = 1e4 + 2, s5maxk = 202;
int dp[s5maxk][s5maxn]; //, trace[s5maxk][s5maxn];
void compute(int l, int r, int optl, int optr, int curk)
{
if (l > r)
return;
int mid = (l + r) / 2;
pair <int, int> best = {LLONG_MIN, -1};
for (int i = optl; i <= min(optr, mid); i++)
{
best = max(best, {dp[curk - 1][i] + (prf[n] - prf[mid]) * (prf[mid] - prf[i]), i});
}
int opt = best.second;
dp[curk][mid] = best.first;
// trace[curk][mid] = opt;
compute(l, mid - 1, optl, opt, curk);
compute(mid + 1, r, opt, optr, curk);
}
void solve()
{
k++;
memset(dp, -0x3f, sizeof(dp));
dp[0][0] = 0;
for (int i = 1; i <= k; i++)
compute(0, n, 0, n, i);
cout << dp[k][n] << '\n';
int curk = k, curb = n;
while (curk > 0)
{
for (int i = 0; i < curb; i++)
{
if (dp[curk - 1][i] + (prf[n] - prf[curb]) * (prf[curb] - prf[i]) == dp[curk][curb])
{
if (i)
cout << i << ' ';
curk--;
curb = i;
}
}
}
}
}
signed main()
{
// setIO();
file;
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], prf[i] = prf[i - 1] + a[i];
if (n <= 50)
return Sub2::solve(), 0;
if (n <= 1000)
return Sub4::solve(), 0;
if (n <= 10000)
return Sub5::solve(), 0;
}
Compilation message
sequence.cpp: In function 'void setIn(std::string)':
sequence.cpp:7:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
7 | void setIn(string s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp: In function 'void setOut(std::string)':
sequence.cpp:8:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
8 | void setOut(string s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:4:53: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
4 | #define file if (fopen("input.txt", "r")) { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:175:5: note: in expansion of macro 'file'
175 | file;
| ^~~~
sequence.cpp:4:87: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
4 | #define file if (fopen("input.txt", "r")) { freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:175:5: note: in expansion of macro 'file'
175 | file;
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
0 ms |
2508 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
117 ms |
2396 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
4 ms |
2396 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
2648 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
25 ms |
2396 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
5 ms |
2396 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
2396 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
8 ms |
2396 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
5 ms |
4444 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
4 ms |
4444 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
5 ms |
4444 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
6 ms |
4440 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
2 ms |
4440 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4444 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
4 ms |
4444 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
118 ms |
4696 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
4444 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
124 ms |
4556 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
109 ms |
4440 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
125 ms |
4440 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
118 ms |
4440 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
27 ms |
4556 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
53 ms |
4444 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
19036 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
4 ms |
19032 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
40 ms |
19160 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
19036 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
54 ms |
19288 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
53 ms |
19036 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
46 ms |
19032 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
32 ms |
19036 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
45 ms |
19036 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
57 ms |
19032 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
3932 KB |
Unexpected end of file - int64 expected |
2 |
Halted |
0 ms |
0 KB |
- |