poj 1260 Pearls 斜率优化dp

一维的比较简单的斜率优化dp

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<queue>
using namespace std;

int dp[105];
int q[105];
int sum[105];
int cost[105];

int head,tail,n;


int getDP(int i,int k)
{
    return dp[k]+(sum[i]-sum[k]+10)*cost[i];
}

int getUP(int k1,int k2)
{
    return dp[k1]-dp[k2];
}
int getDOWN(int k1,int  k2)
{
    return sum[k1]-sum[k2];
}

int main()
{
	int T;
	scanf("%d",&T);
    while(T--)
    {
		scanf("%d",&n);
		int i,j;
		int ta,tb;
		sum[0]=cost[0]=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d%d",&ta,&tb);
			sum[i]=sum[i-1]+ta;
			cost[i]=tb;
		}
		dp[0]=0;
		head=tail=0;
		q[tail++]=0;
		for(i=1;i<=n;i++)
		{
			while(head+1<tail &&  getUP(q[head+1],q[head])<=cost[i]*getDOWN(q[head+1],q[head]))
					head++;
			dp[i]=getDP(i,q[head]);
			while(head+1<tail && getUP(i,q[tail-1])*getDOWN(q[tail-1],q[tail-2])<=getUP(q[tail-1],q[tail-2])*getDOWN(i,q[tail-1]))
                    tail--;
			q[tail++]=i;
		}
        printf("%d\n",dp[n]);
    }
    return 0;
}