| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 247083 | rrrr10000 | 수열 (APIO14_sequence) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
vector<PP> cht;
ll id=0;
void add(ll a,ll b,ll c){
// out(a);out(b);out(c);
while(cht.size()){
if(get<0>(cht.back())==a){
if(b<=get<2>(cht.back()))return;
cht.pop_back();
}
else break;
}
while(cht.size()>1){
auto p=cht[cht.size()-2],q=cht.back();
if((a-get<0>(q))*(b-get<1>(p))>(get<1>(q)-b)*(get<0>(p)-a))break;
cht.pop_back();
}
cht.eb(a,b,c);
}
P getma(ll x){
while(id<cht.size()-1){
if(get<0>(cht[id])*x+get<1>(cht[id])>get<0>(cht[id+1])*x+get<1>(cht[id+1]))break;
id++;
}
return P(get<0>(cht[id])*x+get<1>(cht[id]),get<2>(cht[id]));
}
int main(){
ll n,k;cin>>n>>k;
k++;
vi v(n);
rep(i,n)cin>>v[i];
vi rui(n+1);
rep(i,n)rui[i+1]=rui[i]+v[i];
vector<vector<int>> memo(n+1,vi(k+1));
vi dp(n+1,-inf);
dp[0]=0;
REP(j,1,k+1){
vi ndp(n+1,-inf);
REP(i,1,n+1){
if(dp[i-1]!=-inf)add(rui[i-1],dp[i-1]-rui[i-1]*rui[i-1],i-1);
if(cht.size()){
auto t=getma(rui[i]);
ndp[i]=t.fi;
memo[i][j]=t.se;
}
}
cht=vector<PP>(0);
id=0;
dp=ndp;
}
/*REP(i,1,n+1)REP(j,1,k+1){
rep(t,i)if(chmax(dp[i][j],dp[t][j-1]+rui[t]*(rui[i]-rui[t])))memo[i][j]=t;
}*/
out(dp[n]);
ll j=n;
vi ans;
for(int i=k;i>1;i--){
j=memo[j][i];
ans.pb(j);
}
reverse(all(ans));outv(ans);
}