#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct line
{
ll a, b, index;
};
vector<line>V;
double cross(const line &p, const line &q)
{
return (double)(q.b-p.b)/(p.a-q.a);
}
void push(line x)
{
if(V.size()&&V.back().a==x.a)
{
if(V.back().b<x.b)V.back().b=x.b;
return;
}
while(V.size()>=2)
{
if(cross(V.back(), V[V.size()-2])>cross(V.back(), x))V.pop_back();
else break;
}
V.push_back(x);
}
pair<ll, ll>query(ll x)
{
ll a=0, b=V.size(), m;
while(a+1<b)
{
m=(a+b)/2;
if(cross(V[m-1], V[m])<=x)a=m;
else b=m;
}
return {V[a].a*x+V[a].b, V[a].index};
}
ll n, i, j, k, t, a, b, c, A[100010], dp[100010][2], backtrack[100010][210];
int main()
{
for(scanf("%lld %lld", &n, &k);i++<n;)
{
scanf("%lld", &A[i]);
A[i]+=A[i-1];
}
for(j=0;j++<k;)
{
for(i=0;i++<n;)
{
push({A[i], dp[i][0]-A[i]*A[i], i});
pair<ll, ll>p=query(A[i]);
dp[i][1]=p.first;
backtrack[i][j]=p.second;
dp[i][0]=dp[i][1];
}
V.clear();
}
printf("%lld\n", dp[n][1]);
i=n;
j=k;
vector<ll>ans;
while(j>0)
{
i=backtrack[i][j];
j--;
ans.push_back(i);
}
while(ans.size())
{
printf("%lld ", ans.back());
ans.pop_back();
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
41 | for(scanf("%lld %lld", &n, &k);i++<n;)
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
sequence.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
43 | scanf("%lld", &A[i]);
| ~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
0 ms |
364 KB |
Integer 2 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
620 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
620 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
3 ms |
620 KB |
Integer 200 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
2028 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
2028 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
2028 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
2028 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
2028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
2028 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
2028 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
17324 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
13 ms |
17324 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
174 ms |
17384 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
13 ms |
17384 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
104 ms |
17324 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
129 ms |
17324 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
141 ms |
17384 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
127 ms |
17384 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
125 ms |
17384 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
158 ms |
17384 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
109 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
