【题目链接】
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=698
【原题】
John is going on a fishing trip. He hashhours available (),
and there arenlakes in the area () all reachable along a single, one-way road. John starts at lake 1, but he
can finish at any lake he wants. He can only travel from one lake to the next one, but he does not have to stop at any lake unless he wishes to. For each,
the number of 5-minute intervals it takes to travel from lakeito lakei+ 1 is denotedti().
For example,t3= 4 means that it takes 20 minutes to travel from lake 3 to lake 4.
To help plan his fishing trip, John has gathered some information about the lakes. For each lakei, the number of fish expected to be caught in the initial 5 minutes, denotedfi(),
is known. Each 5 minutes of fishing decreases the number of fish expected to be caught in the next 5-minute interval by a constant rate ofdi().
If the number of fish expected to be caught in an interval is less than or equal todi, there will be no more fish left in the lake in the next interval. To simplify the planning, John assumes that no one else will be fishing at
the lakes to affect the number of fish he expects to catch.
Write a program to help John plan his fishing trip to maximize the number of fish expected to be caught. The number of minutes spent at each lake must be a multiple of 5.
You will be given a number of cases in the input. Each case starts with a line containingn.
This is followed by a line containingh. Next, there is a line ofnintegers
specifyingfi(),
then a line ofnintegersdi(),
and finally, a line ofn- 1 integersti().
Input is terminated by a case in whichn= 0.
For each test case, print the number of minutes spent at each lake, separated by commas, for the plan achieving the maximum number of fish expected to be caught (you should print the entire plan on one
line even if it exceeds 80 characters). This is followed by a line containing the number of fish expected. If multiple plans exist, choose the one that spends as long as possible at lake 1, even if no fish are expected to be caught in some intervals. If there
is still a tie, choose the one that spends as long as possible at lake 2, and so on. Insert a blank line between cases.
2
1
10 1
2 5
2
4
4
10 15 20 17
0 3 4 3
1 2 3
4
4
10 15 50 30
0 3 4 3
1 2 3
0
45, 5
Number of fish expected: 31
240, 0, 0, 0
Number of fish expected: 480
115, 10, 50, 35
Number of fish expected: 724
【分析与总结】
超级经典的一道贪心题,LRJ黑书上贪心章节的第一道例题。
我是用堆来实现的。
【代码】
/*
* UVa: 757 - Gone Fishing
* Greedy
* Time: 0.044s(UVa), 79MS(poj)
* Author: D_Double
*
*/
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#define MAXN 30
using namespace std;
int h,n;
int ans[MAXN], tmp[MAXN];
struct Node{
int no; // 第几号湖
int rate; // 每5分钟钓的鱼
int down; // 每5分钟减少的钓鱼数量
int time; // 从第一个湖走到当前这个湖的时间
friend bool operator < (const Node&a,const Node&b){
if(a.rate!=b.rate)
return a.rate<b.rate;
return a.no>b.no; // 如果每5分钟钓的鱼相同,优先序号钓小的湖
}
}arr[MAXN];
priority_queue<Node>que;
void greedy(){
int maxSum=-10000;
for(int i=0; i<n; ++i){ // 枚举钓1~i个湖的情况
while(!que.empty()) que.pop();
for(int j=0; j<=i; ++j) que.push(arr[j]);
int leftTime=h*60-arr[i].time, sum=0;
memset(tmp, 0, sizeof(tmp));
while(leftTime > 0){
Node temp=que.top();
que.pop();
if(temp.rate<=0) break;
sum += temp.rate;
temp.rate -= temp.down;
tmp[temp.no] += 5;
que.push(temp);
leftTime -= 5;
}
if(leftTime>0) tmp[0] += leftTime; // 注意把剩下的时间都加到第一个湖上
if(sum > maxSum){
maxSum=sum;
for(int j=0; j<n; ++j)
ans[j]=tmp[j];
}
}
printf("%d",ans[0]);
for(int i=1; i<n; ++i)
printf(", %d",ans[i]);
printf("\n");
printf("Number of fish expected: %d\n", maxSum);
}
int main(){
bool flag=false;
while(~scanf("%d",&n)&&n){
scanf("%d",&h);
for(int i=0; i<n; ++i){
scanf("%d",&arr[i].rate);
arr[i].no = i;
}
for(int i=0; i<n; ++i){
scanf("%d",&arr[i].down);
}
arr[0].time=0;
for(int i=1; i<=n-1; ++i){
int t;
scanf("%d",&t);
arr[i].time = arr[i-1].time+t*5;
}
if(flag)printf("\n");
else flag=true;
greedy();
}
return 0;
}
—— 生命的意义,在于赋予它意义。
分享到:
相关推荐
判断输入字符串是否为镜像或回文串。 来源于UVaOJ - 401. 水题。
开源项目-codingsince1985-UVa#uva-online-judge-solutions-in-golang.zip,两年来每天都在解决一个uva在线裁判问题,算起来…
uva705 Slash Maze 的代码,在UVaOJ上通过
PDF试题
uva532 Dungeon Master的源代码,并且AC了
Algorithm-UVA-Solutions-in-Python.zip,python 3中各种uva(acm)问题的解决方案。,算法是为计算机程序高效、彻底地完成任务而创建的一组详细的准则。
这是UVA133 TheDoleQueue救济金发放问题,经典的算法问题。初学算法的人要对这种算法非常熟悉并且能熟练运用。
tpcw-nyu-uva-client 客户端
leetcode 2 算法-Java UVa Online Judge(ACM-ICPC Live ...使用:数组、哈希表、链表、二分搜索、动态规划、堆栈、堆、reedy、排序、树 DFS、BFS、图、二分搜索树、递归、记忆、队列、映射等。...Uva-ACM-ICPC