UVALIVE 2675 Peals (POJ 1260 HDU 1300)

题意：复制别人的。题目大意购买珍珠，珍珠按品质分为C类，购买的规则购买某一种珍珠则需要另付10个那种品质的价格，可以选择购买高品质代替低品质。

定义 dp[i]表示由低至高到第i个品级的最小花费 

状态转移 dp[i]=min(dp[i],dp[j]+(sum(i,j)+10)*p[i];

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b == 0 ? b : gcd(b, a % b);}
#define MAXN  110
int a[MAXN],p[MAXN];
int sum[MAXN];
int dp[MAXN];
int C;
void read()
{
    sum[0]=0;
    scanf("%d",&C);
    memset(sum,0,sizeof(sum));
    for (int i=1;i<=C;i++)
    {
        scanf("%d%d",&a[i],&p[i]);
        sum[i]=sum[i-1]+a[i];
    }
}
int main()
{
    //freopen("sample.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while (T--)
    {
        read();
        memset(dp,0x3f,sizeof(dp));
        dp[0]=0;
        //printf("%d %d\n",dp[1],0x3f3f3f3f);
        for (int i=1;i<=C;i++)
        {
            for (int j=1;j<=i;j++)
                dp[i]=min(dp[i],dp[j-1]+(10+sum[i]-sum[j-1])*p[i]);
            //printf("%d %d\n",i,dp[i]);
        }
        printf("%d\n",dp[C]);
    }
    return 0;
}