NYOJ 题目716 River Crossing
2016-05-18 21:24
465 查看
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
来源
第六届河南省程序设计大赛
DP最经典的用最优子结构递推做法
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1001;
int timea
, dp
;
int main()
{
int t;
cin>>t;
while(t--)
{
int n, m;
cin>>n>>m;
memset(timea,0,sizeof(timea));
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
int x;
cin>>x;
timea[i]=timea[i-1]+x;
}
for(int i=1;i<=n;i++)
{
dp[i]=timea[i]+m;
for(int j=1;j<i;j++)
{
dp[i]=min(dp[i],dp[i-j]+dp[j]+m);
}
}
cout<<dp
<<endl;
}
return 0;
}
相关文章推荐
- OC 对象整合练习题
- 区间动规经典(水题)大合集
- 归并排序算法(排序详解)
- THUCTC源码解读(二)
- 【HYSBZ 1503: [NOI2004]】郁闷的出纳员——伸展树
- 练习打字第十一天!
- 使用jetty-maven-plugin插件进行测试
- 解决MYSQL出现 Can't create/write to file 'C:/WINDOWS/TEMP/#sql_5c0_0.MYD'
- 利用java与链表的实现与应用
- 【BZOJ1051】受欢迎的牛,tarjan缩点重构图
- LaTeX技巧003:enumerate环境设置缩进
- 【BZOJ-4591】超能粒子炮·改 数论 + 组合数 + Lucas定理
- 第十二周技术博客
- PHP AJAX返回 "TEXT"
- 解码H264文件的一些基础知识
- 极角排序
- Java文件流 字节流和字符流
- 深入浅出: Java回调机制(异步)
- 我的Unity3D学习日记-01
- JAVA获取本机IP地址