Crossing River(贪心+模拟)
来源:互联网 发布:软件未响应关不掉 编辑:程序博客网 时间:2024/04/26 04:03
Crossing River
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uDescription
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
如果有N个人(N>=1)
如果N=1或N=2;所有人直接过河。
如果N=3;由最快的人往返一次把其他两人送过河。
如果N>=4;设A,B为走的最快的和次快的人,过桥时间为a,b;
设Z,Y是走的最慢和次慢的人,过桥时间为z,y:
当2b>a+y时,使用模式一将Z,Y送过桥
当2b<a+y时,使用模式二将Z,Y送过桥
当2b=a+y时,使用模式一或模式二将Z,Y送过桥
问题变回n-2个人,递归解决。
模式一:A将Z送过桥,然后返回,再把Y送过桥,再返回。
模式二:A,B先过桥,然后A返回,Y和Z过桥,然后B返回。
//过河问题#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[1005];int main(){ int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); if(n<=2) { printf("%d\n",a[n-1]); continue; } int sum=a[1];//最后一定是 a[0]。a[1]回去 while(n>3) { if(a[0]+a[n-1]+a[0]+a[n-2]>=a[0]+a[1]+a[n-1]+a[1]) sum+=a[0]+a[1]+a[n-1]+a[1]; else sum+=a[0]+a[n-1]+a[0]+a[n-2]; n-=2; } if(n==3) sum+=(a[0]+a[2]); printf("%d\n",sum); }}
1 0
- Crossing River(贪心+模拟)
- Crossing River(贪心 博弈)
- POJ1700 Crossing River(贪心)
- POJ1700--Crossing River(贪心)
- POJ 1700 Crossing River(贪心)
- poj1700 crossing river 贪心(手动翻译)
- POJ 1700 Crossing River (贪心法)
- POJ 1700 Crossing River(贪心)
- poj1700 Crossing River 贪心
- poj1700--贪心--Crossing River
- 【贪心】Crossing River
- ACM 贪心 Crossing River
- POJ - 1700 Crossing River【贪心】
- poj 1700 Crossing River(贪心)
- POJ--1700:Crossing River (贪心)
- poj 1700 Crossing River 【贪心】
- poj 1700 Crossing River 贪心
- poj 1700 Crossing River 贪心
- [Spring] 声明Bean
- 唤醒锁: 检测 Android* 应用中的 No-Sleep(无法进入睡眠)问题
- 学习笔记之2016_3_13
- hdu3469Watch The Movie【分组背包】二维dp数组
- Linux内核学习方法
- Crossing River(贪心+模拟)
- 75道程序员逻辑思维题
- Android电源管理之一:基础概览
- STL 交并补差
- Android平台Java线程池启动耗时.
- STL-序列式容器
- Oracle RAC备份与恢复
- new : HTML5 中的新属性
- 二分查找(边界问题)