hdu1300Pearls【动态规划】

#include <iostream>
using namespace std;


//dp[i]是买够i种产品的最少话费，
//每种产品都可以以档次高和前面档次低的一起买
//状态方程为dp[i] = min(dp[i], dp[j - 1] + sum), sum为(a[0] + ..+a[j] + 10) ,  0 <= j <= i


#define MSIZ 1010
#define NSIZ 110


typedef struct Node_
{
	int ai;
	int pi;
}Node[NSIZ];


int dp[MSIZ]; 


Node node;


int main()
{
	int t, i, j,n, m, p, q;
	int k, sum;
	scanf("%d", &t);
	while(t--)
	{
		scanf("%d", &n);
		for(i = 0;i < n; ++i)
		{
			scanf("%d %d", &node[i].ai, &node[i].pi);
		}
		memset(dp, 0, sizeof(dp));


		dp[0] = (node[0].ai + 10 ) * node[0].pi;
		for(i = 1;i < n; ++i)
		{
			dp[i]  = INT_MAX;


			for(j = 0; j <= i;++j)
			{
				sum = 10;
				for(k = j; k <= i; ++k)
				{
					sum += node[k].ai;
				}
				sum *= node[i].pi;
				dp[i] = min(dp[i], dp[j - 1] + sum);
			}
		}


		printf("%d\n", dp[n-1]);


	}
	return  0;
}