POJ1700:Crossing River
来源:互联网 发布:相册模板制作软件 编辑:程序博客网 时间:2024/05/22 17:51
Description
A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a different rowing speed; the speed of a couple is determined by the speed of the slower one. Your job is to determine a strategy that minimizes the time for these people to get across.
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won't be more than 1000 people and nobody takes more than 100 seconds to cross.
Output
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
Sample Input
141 2 5 10
Sample Output
17
题意:也就是一个坐船问题,一共有两个策略
①最快和次快过去,最快回;最慢和次慢过去,次快回,t=s[1]+s[0]+s[n-1]+s[1]。②最快和最慢过去,最快回;最快和次快过去,最快回,t=s[n-1]+s[0]+s[n-2]+s[0]。选择两者中用时较少的一个策略执行。如此便将最慢和次慢送过河,对剩下n-2个人循环处理。注意当n=1、n=2、n=3时直接相加处理即可。
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ int a[1005],i,t,n,sum; scanf("%d",&t); while(t--) { scanf("%d",&n); sum = 0; for(i = 0;i<n;i++) scanf("%d",&a[i]); while(n>3) { sum = min(sum+a[1]+a[0]+a[n-1]+a[1],sum+a[n-1]+a[0]+a[n-2]+a[0]); n-=2; } if(n==3) sum+=a[0]+a[1]+a[2]; else if(n==2) sum+=a[1]; else sum+=a[0]; printf("%d\n",sum); } return 0;}
- POJ1700 Crossing River DP
- Crossing River POJ1700
- poj1700 Crossing River 贪心
- POJ1700 Crossing River
- POJ1700:Crossing River
- Crossing River poj1700
- POJ1700 Crossing River
- poj1700--贪心--Crossing River
- poj1700 Crossing River
- POJ1700 Crossing River
- poj1700 Crossing River
- POJ1700 Crossing River
- Crossing River(POJ1700)
- POJ1700 Crossing River
- POJ1700 Crossing River 过河问题
- POJ1700 Crossing River(贪心)
- POJ1700--Crossing River(贪心)
- poj1700 crossing river 贪心(手动翻译)
- 用SecureRDP限制指定的计算机名,MAC,IP才能登陆服务器的远程桌面
- 班级学生德育量化管理系统_德育积分学分考核系统_学生操行日常行为规范考核系统
- linux系统的7种运行级别
- UITableView
- Spring Batch 之 框架流程简单介绍(二)
- POJ1700:Crossing River
- 给我一篇假论文,我能骗倒半个地球
- int main(int argc,char* argv[])详解
- Python基础学习笔记之(二)
- 《Head Rush Ajax》读书笔记
- Spring Batch 之 Sample(Hello World)(三)
- 5 关联式容器-set map multiset multimap
- The project: ems which is referenced by the classpath, does not exist.
- 2013的年终总结