10187. 「一本通 5.6 例 4」Cats Transport

#include<algorithm>
#include<bitset>
#include<complex>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<cmath>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#define int long long
using namespace std;
inline int read(){
    int res=0,f=1;char ch=getchar();
    while(ch<'0'ch>'9'){if(ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') res=res*10+ch-'0',ch=getchar();
    return res*f;
}
inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x<10) putchar(x+'0');
    else{
        write(x/10);
        putchar(x%10+'0');
    }
}
//queue<int> q;
//set<int> s;
//priority_queue<int> q1;
//priority_queue<int,vector<int>,greater<int> > q2;
//list<int> l;
//stack<int> s;
int n,m,p,a[100010],s[100010],q[100010],h,t,g[100010],d[100010],f[110][100010];
signed main(){
    n=read();m=read();p=read();
    for(int i=2;i<=n;i++) d[i]=d[i-1]+read();
    for(int i=1;i<=m;i++){
        h=read();t=read();
        a[i]=t-d[h];
    }
    sort(a+1,a+m+1);
    for(int i=1;i<=m;i++) s[i]=s[i-1]+a[i];
    //O(PM^2)做法
//  memset(f,0x3f,sizeof(f));f[0][0]=0;
//  for(int i=1;i<=p;i++){
//      for(int j=0;j<=m;j++){
//          for(int k=0;k<=m;k++){
//              f[i][j]=min(f[i][j],f[i-1][k]+a[j]*j-a[j]*k-s[j]+s[k]);
//          }
//      }
//  }
//  cout<<f[p][m]<<endl;
    
    memset(f,127,sizeof(f));f[0][0]=0;
    
    for(int i=1;i<=p;i++){
        for(int j=1;j<=m;j++) g[j]=f[i-1][j]+s[j];
        h=1;t=1;q[1]=0;
        for(int j=1;j<=m;j++){
            while(h<t&&(g[q[h+1]]-g[q[h]])<=a[j]*(q[h+1]-q[h])) h++;
            f[i][j]=min(f[i-1][j],g[q[h]]+a[j]*(j-q[h])-s[j]);
            if(g[j]>=2e18) continue;
            while(h<t&&(g[j]-g[q[t]])*(q[t]-q[t-1])<=(g[q[t]]-g[q[t-1]])*(j-q[t])) t--;
            q[++t]=j;
        }
    }
    write(f[p][m]);putchar('\n');
    return 0;
}