이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll inf=1e3+9,K=209;
ll n,k,ans,idx;
ll pre[inf],a[inf];
pair<ll,ll> dp[inf][K];
vector<ll> split;
ll sum(ll x,ll y){
return pre[y]-pre[x];
}
int main(){
cin>>n>>k;
assert(n>1);
for(ll i=1;i<=n;i++)
cin>>a[i],pre[i]=pre[i-1]+a[i];
for(ll j=1;j<=k;j++)
for(ll i=1;i<=n;i++)
for(ll z=0;z<i;z++)
dp[i][j]=max(dp[i][j],make_pair(dp[z][j-1].first+sum(z,i)*sum(i,n),z));
for(ll i=1;i<=n;i++)
if(ans<dp[i][k].first)
ans=dp[i][k].first,idx=i;
split.push_back(idx);
for(ll j=k;j>1;j--)
idx=dp[idx][j].second,split.push_back(idx);
reverse(split.begin(),split.end());
cout<<ans<<endl;
for(auto o:split)
cout<<o<<" ";
cout<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |