Submission #523607

#	Time	Username	Problem	Language	Result	Execution time	Memory
523607		DanerZein	Discharging (NOI20_discharging)	C++14	0 / 100	1089 ms	16012 KiB

Discharging

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N=1e6+10;
const int MAX_P=MAX_N*4;
const int MAX=1e9;
ll val[MAX_N];
ll n;
ll mdp[MAX_N];
ll coste(ll i,ll x){
  ll tx=n+1; tx*=x;
  ll b=mdp[i-1]-i*x;
  return tx+b;
}
int time(int i,int j){
  ll l=val[i],r=val[i];
  while(coste(i,r)>coste(j,r)){
    l=r+1;
    r*=2;
  }
  while(r-l>1){
    ll mid=(l+r)/2;
    if(coste(i,mid)>=coste(j,mid)) r=mid;
    else l=mid;
  }
  return r;
}
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin>>n;
  for(int i=0;i<n;i++){
    int a; cin>>a;
    val[i+1]=a;
  }
  mdp[0]=0;
  deque<int> dq;
  
  for(int i=1;i<=n;i++){
    int t=dq.size();
    while(t>=3 && time(dq[t-2],dq[t-1])>=time(dq[t-2],i)){
      dq.pop_back(); t--;
    }
    dq.push_back(i);
    while(dq.size()>=2 && coste(dq[0],val[i])>=coste(dq[1],val[i])){
      dq.pop_front();
    }
    mdp[i]=coste(dq.front(),val[i]);
  }
  cout<<mdp[n]<<endl;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 11
• Subtask 5: 0 / 14
• Subtask 6: 0 / 28