Submission #289218

#	Time	Username	Problem	Language	Result	Execution time	Memory
289218		NaimSS	Split the sequence (APIO14_sequence)	C++14	11 / 100	81 ms	131076 KiB

sequence

#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) (int)v.size()
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl; 
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}

const int N = 100100;
ll pre[N],a[N];
ll dp[N][201];
int go[N][201];

ll cost(int id,int k,int pr){
  
  return dp[id][k-1] - pre[id]*pre[id] + pre[id]*pr;
}

bool bad(int id1,int id2,int pr,int k){
  return cost(id2,k,pr) >= cost(id1,k,pr);
}

int32_t main(){
  fastio;
  int n,K;
  cin >> n >> K;
  for(int i=1;i<=n;i++){
    cin >> a[i];
    pre[i] = a[i] + pre[i-1];
  }

  for(int k=1;k<=K;k++){
    int curline = 0;
    for(int i=1;i<=n;i++){
      while(curline < i and bad(curline,curline+1,pre[i],k)){
        curline++;
      }
      go[i][k] = curline;
      dp[i][k] = cost(curline,k,pre[i]);  
      
    }
  }
  cout << dp[n][K] << endl;
  vi res;
  int cur = n;
  for(int i=K;i>=1;i--){
    res.pb(go[cur][i]);
    cur = go[cur][i];
  }
  for(int x : res)cout << x<<" ";
  cout<<endl;

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

• Subtask 1: 0 / 11
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29