· 题目716
River Crossing
时间限制:1000 ms | 内存限制:65535 KB
难度:4
描述
Afandi is herding N sheep across the expanses of grassland when he finds himself blocked by a river.A single raft is available for transportation.Afandi knows that he must ride on the raft for all crossings,but adding sheep to the raft makes it traverse the river more slowly.When Afandi is on the raft alone,it can cross the river in M minutes When the i sheep are added,it takes Mi minutes longer to cross the river than with i-1 sheep(i.e.,total M+M1 minutes with one sheep,M+M1+M2 with two,etc.).Determine the minimum time it takes for Afandi to get all of the sheep across the river(including time returning to get more sheep).
输入
On the first line of the input is a single positive integer k,telling the number of test cases to follow.1≤k≤5 Each case contains:
*Line 1:one space-separated integers:N and M(1≤N≤1000,1≤M≤500).
*Lines 2..N+1:Line i+1 contains a single integer:Mi(1≤Mi≤1000)
输出
For each test case,output a line with the minimum time it takes for Afandi to get all of the sheep across the river.
样例输入
2
2 10
3
5
5 10
3
4
6
100
1
样例输出
18
50
这道题有K组数据,N表示i个小羊过河比i-1个小羊过河多多少时间,M表示不带小羊自己过河的时间,让你求让所有羊过河的最小时间。
理解题后很好做;
f[1]=f[1]+m;
f[2]=min{ (f[2] +m) , (f[1]+m+f[1]) };每次拆成两步再加上 人返回的时间m
f[3]=min{ (f[3]+m) , (f[1]+m+f[2]) }; 每次借助之前保存的最优解;
f[n]=min{ (f[n]+m) , (f[n-1]+m+f[1]), .... , f[(n+1)/2]+m+f[n/2] }
#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
#define N 1005
int a[N];
int f[N];
int main()
{
int n,m,t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
f[i]=a[i]+f[i-1];
}
f[1]+=m;
f[2]=min((f[1]+f[1]+m),(f[2]+m));
for(int i=3;i<=n;i++)
{
f[i]+=m;
int minn=f[i];
for(int j=1;j<=i/2;j++)//到i/2就可以,之后的会与前面的重复
{
if(minn>f[i-j]+f[j]+m)
minn=f[i-j]+f[j]+m;
}
f[i]=minn;
}
printf("%d\n",f[n]);
}
return 0;
}