Sicily 2502

最新推荐文章于 2017-12-20 22:06:30 发布

原创最新推荐文章于 2017-12-20 22:06:30 发布 · 322 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#bi #ini

DP 专栏收录该内容

13 篇文章

订阅专栏

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define M 1000
int n;
int ar[M];
int arr[M];
int dp[M];

int getnum(int a,int b,int price)
{
	int sum = 0;
	for(int i=a;i<=b;i++)
		sum += ar[i];
	sum += 10;
	return sum *price;
}
int mins(int a,int b)
{
	return a>b?b:a;
}
void dps()
{
	dp[0] = (ar[0]+10)*arr[0];
	for(int j=1;j<n;j++)
	{
		if(ar[j] == 0) dp[j] = dp[j-1];
		else 
		dp[j] = dp[j-1]+(ar[j]+10)*arr[j];
		for(int k=0;k<j;k++)
		{
			if(k>=1)
			dp[j] = mins(dp[j],dp[k-1]+getnum(k,j-1,arr[j])+ar[j]*arr[j]);
			else
				dp[j] =  mins(dp[j],getnum(k,j-1,arr[j])+ar[j]*arr[j]);
		}
	}
}
void init()
{
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<n;i++)
			PF(ar[i]);
		for(int j=0;j<n;j++)
			PF(arr[j]);

		memset(dp,0,sizeof(dp));
		dps();
		PR(dp[n-1]);
	}
	return ;
}
int main()
{
	init();
	return 0;
}