【POJ2018 Best Cow Fences】 求斜率

POJ2018
题意就是求 (sum[i] - sum[j-1]) /(i - (j-1))
我们发现这就是 sum函数的斜率
那么我们从左向右维护一个下凸函数
言外之意 上凸点肯定是不符合不需要枚举的
那么我们每次枚举 然后再根据斜率单调上升
就可以O(n)的找出这个最大的值
用一个模拟双端队列维护即可

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 20025;
struct node
{
    int sum,dis;
}arr[MAX_N];
ll cnt[MAX_N],dis[MAX_N],SUM[MAX_N],q[MAX_N],dp[MAX_N],h = 0,t=1;
double cal(int i,int j)
{
    return (1.0*(cnt[i]*dis[i]-cnt[j]*dis[j])/(cnt[i]-cnt[j]));
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i = 1;i<=n;++i)
    {
        scanf("%d%d",&arr[i].sum,&arr[i].dis);
        cnt[i] = cnt[i-1] + arr[i].sum;
        dis[i+1] = dis[i] + arr[i].dis;
        SUM[i+1] = SUM[i]+cnt[i]*arr[i].dis;
    }
    cnt[n+1] = cnt[n];
    q[++h] = 1;
    for(int i = 2;i<=n;++i)
    {
        while(h<t&&cal(q[h],q[h+1])<dis[i]) h++;
        dp[i] = SUM[n+1] - cnt[q[h]]*(dis[i] - dis[q[h]]) - cnt[i]*(dis[n+1] - dis[i]);
        while(h<t&&cal(q[t],i)<cal(q[t],q[t-1])) t--;
        q[++t] = i;

    }
    int ans =inf;
    for(int i = 2;i<=n;++i) ans = min(1ll*ans,dp[i]);
    printf("%d\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}