| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 740303 | josanneo22 | 수열 (APIO14_sequence) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
void solve(){
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
void solve(){
int n,k; cin>>n>>k;
vector<int> a(n+1);
for(int i=1;i<=n;i++) cin>>a[i];
if(n==1){
cout<<"0\n1"; return;
}
vector<int> pre(n+1);
for(int i=1;i<=n;i++) pre[i]=pre[i-1]+a[i];
vector<vector<int>> dp(n+1,vector<int>(k+1,-1e9)),from(n+1,vector<int>(k+1,-1));
for(int i=0;i<=n;i++) dp[i][0]=0;
for(int i=0;i<=k;i++) dp[0][i]=0;
for(int i=0;i<=n;i++){
for(int j=0;j<=i;j++){
for(int s=k;s>=1;s--){
if(dp[j][s-1]!=-1e9){
if(dp[j][s-1]+(pre[i]-pre[j])*(pre[n]-pre[i])>dp[i][s]){
dp[i][s]=dp[j][s-1]+(pre[i]-pre[j])*(pre[n]-pre[i]);
from[i][s]=j;
}
}
}
}
}
int mx=-1,x=0,y=0;
for(int i=0;i<n;i++){
if(dp[i][k]>mx){
mx=dp[i][k];
x=i; y=k;
}
}
cout<<mx<<'\n';
vector<int> ans;
for(int i=y;i>=1;i--){
ans.pb(x);
x=from[x][i];
}
reverse(ans.begin(),ans.end());
if(ans.size()<k){
for(int i=1;i<=k;i++){
cout<<i<<' ';
}
}
for(auto&x:ans) cout<<x<<' ';
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
solve();
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
solve();
}