河南省第六届ACM River Crossing
来源:互联网 发布:淘宝默认发票抬头 编辑:程序博客网 时间:2024/05/05 23:19
1629: River Crossing
时间限制: 1 Sec 内存限制: 128 MB提交: 20 解决: 15
[提交][状态]
题目描述
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.
样例输入
22 10355 103461001
样例输出
1850
提示
来源
河南省第六届大学生程序设计竞赛
题意:有1个人和N只羊要过河。一个人单独过河花费的时间是M,每次带一只羊过河花费时间M+M1,带两
羊过河花费时间M+M1+M2……给出N、M和Mi,问N只羊全部过河最少花费的时间是多少。
思路:dp[i]表示一个人和i只羊过河所花费的最短时间,首先dp[0] = m, dp[i] = dp[i-1] + time, 以后更
时,dp[i] = min(dp[i],dp[i-j] + m + dp[j]),j从1循环到i-1,即把i只羊分成两个阶段来运,只需求出
两个阶段的和,然后加上人从对岸回来所用的时间,与dp[i]进行比较,取最小值。
#include <stdio.h>
#include <string.h>
#include <algorithm>
using
namespace
std;
int
dp[1005];
int
main()
{
int
k,n,m,a;
scanf
(
"%d"
,&k);
while
(k--)
{
scanf
(
"%d%d"
,&n,&m);
dp[0]=m;
for
(
int
i=1;i<=n;i++)
{
scanf
(
"%d"
,&a);
dp[i]=dp[i-1]+a;
}
for
(
int
i=1;i<=n;i++)
for
(
int
j=1;j<i;j++)
dp[i]=min(dp[i],dp[i-j]+dp[j]+m);
printf
(
"%d\n"
,dp[n]);
}
return
0;
}
/**************************************************************
Problem: 1629
User: 154115061005
Language: C++
Result: 正确
Time:4 ms
Memory:820 kb
****************************************************************/
- 河南省第六届ACM River Crossing
- nyoj 716 River Crossing 第六届河南省程序设计大赛
- 河南第六届ACM省赛(River Crossing)
- NYOJ - 716 - River Crossing --第六届河南省程序设计大赛 (简单DP!!)
- 第六届河南省赛 zzulioj 1488: River Crossing (一维DP)nyoj 716
- nyoj716 River Crossing (动态规划)(第六届河南省程序设计大赛)
- ACM--Crossing River
- ACM 贪心 Crossing River
- 第六届程序设计大赛 River Crossing(不懂)
- Crossing River
- Crossing River
- Crossing River
- Crossing River
- Crossing River
- River Crossing
- Crossing River
- 河南省第六届ACM大学生程序设计竞赛 排行榜
- 河南省第六届acm省赛 异 形 卵(暴力)
- os中的mmu介绍
- 【一天一道LeetCode】索引目录 ---C++实现
- 中间件涉及的标准
- JAVA学习 (1) main函数
- 【LeetCode】338. Counting Bits
- 河南省第六届ACM River Crossing
- SECURELY CONNECT IOT SENSOR TO THE INTERNET WITH MQTT 1
- PYthon读串口
- Myeclipse优化中心
- 关于Android蓝牙4.0Ble设备开发技术点
- Apache POI介绍
- Java多线程用法解析
- linux 不能启动disk启动失败.
- iOS设置启动页停留时间