제출 #114188

#제출 시각아이디문제언어결과실행 시간메모리
114188dorijanlendvaj수열 (APIO14_sequence)C++14
71 / 100
393 ms131072 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define x first #define y second #define pii pair<int,int> #define pb push_back #define eb emplace_back using namespace std; using namespace __gnu_pbds; typedef long long int ll; typedef unsigned long long int ull; int MOD=1000000007; int MOD2=998244353; vector<int> bases; const ll LLINF=1ll<<60; const char en='\n'; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void yes() {cout<<"YES"<<en; exit(0);} void no() {cout<<"NO"<<en; exit(0);} inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;} template<class T> void prVec(vector<T> w) { cout<<w.size()<<endl; for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' '; if (w.size()) cout<<w[w.size()-1]<<endl; } void M998() { swap(MOD,MOD2); } ll raand() { ll a=rund(); a*=RAND_MAX; a+=rund(); return a; } #define rand raand ll raaand() { return raand()*(MOD-7)+raand(); } string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; } string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; } ll sti(string a) { ll k=0; for (int i=0;i<(int)a.size();++i) { k*=10; k+=a[i]-'0'; } return k; } string its(ll k) { if (k==0) return "0"; string a; while (k) { a.push_back((k%10)+'0'); k/=10; } reverse(a.begin(),a.end()); return a; } ll min(ll a,int b) { if (a<b) return a; return b; } ll min(int a,ll b) { if (a<b) return a; return b; } ll max(ll a,int b) { if (a>b) return a; return b; } ll max(int a,ll b) { if (a>b) return a; return b; } ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b,a%b); } ll lcm(ll a,ll b) { return a/gcd(a,b)*b; } template<class T,class K> pair<T,K> mp(T a,K b) { return make_pair(a,b); } inline int mult(ll a,ll b) { return (a*b)%MOD; } inline int pot(int n,int k) { if (k==0) return 1; ll a=pot(n,k/2); a=mult(a,a); if (k%2) return mult(a,n); else return a; } int divide(int a,int b) { return mult(a,pot(b,MOD-2)); } inline int sub(int a,int b) { if (a-b>=0) return a-b; return a-b+MOD; } inline int add(int a,int b) { if (a+b>=MOD) return a+b-MOD; return a+b; } bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) { if (a%i==0) return 0; } return 1; } ll has(string x) { ll h1=0,h2=0; x=to_lower(x); for (char a: x) { h1*=bases[0]; h1+=a-'a'; h1%=bases[3]; h2*=bases[1]; h2+=a-'a'; h2%=bases[4]; } return h1*(MOD+13893829)+h2; } const int N=100010; int n,k,op[210][N],ps[N]; ll dp[210][N]; //vector<pair<pii,pii>> v; int dx[]={0,1,0,-1}; int dy[]={1,0,-1,0}; /*void addLine(int a,int b) { if (v.empty()) { v.pb({{0,MOD},{a,b}}); return; } int c=v.back().y.x,d=v.back().y.y; if ((b-d)%(c-a)==0) { int z=(b-d)/(c-a); v.back().x.x=z; v.pb({{0,z-1},{a,b}}); } else { int z=(b-d)/(c-a); v.back().x.x=z+1; v.pb({{0,z},{a,b}}); } } ll getVal(int x) { auto r=lower_bound(v.rbegin(),v.rend(),mp(mp(x+1,0),mp(0,0))); --r; return r->y.x*1ll*x+r->y.y; }*/ void d(int k,int l,int r,int lopt,int ropt) { if (l>=r) return; ll ma=-LLINF; int opt=MOD; int mid=(l+r)/2; for (int i=lopt;i<=min(mid-1,ropt);++i) { ll val=dp[k-1][i]+1ll*(ps[n]-ps[mid])*(ps[mid]-ps[i]); if (val>ma) { opt=i; ma=val; } } dp[k][mid]=ma; op[k][mid]=opt; d(k,l,mid,lopt,opt); d(k,mid+1,r,opt,ropt); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); for (int i=0;i<10;++i) bases.push_back((rand()%MOD+13893829)%MOD); cin>>n>>k; for (int i=0;i<n;++i) { int a; cin>>a; ps[i+1]=ps[i]+a; } for (int i=1;i<=k;++i) { d(i,0,n,0,n); //for (int j=0;j<n;++j) if (dp[i][j]>0) cout<<dp[i][j]<<' '; //else cout<<"-1 "; //cout<<en; } int r=0; for (int i=0;i<n;++i) if (dp[k][i]>dp[k][r]) r=i; cout<<dp[k][r]<<endl; vector<int> a; for (int i=k;i>=1;--i) { a.pb(r); r=op[i][r]; } reverse(a.begin(),a.end()); for (auto b: a) cout<<b<<' '; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...