POJ 1042:Gone Fishing【贪心】
来源:互联网 发布:python字符串的长度 编辑:程序博客网 时间:2024/05/23 01:26
Gone Fishing
Time Limit: 2000MS Memory Limit: 32768KTotal Submissions: 31867 Accepted: 9639
Description
John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) 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 i = 1,...,n - 1, the number of 5-minute intervals it takes to travel from lake i to lake i + 1 is denoted ti (0 < ti <=192). 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 lake i, the number of fish expected to be caught in the initial 5 minutes, denoted fi( fi >= 0 ), 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 of di (di >= 0). If the number of fish expected to be caught in an interval is less than or equal to di , 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.
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.
Input
You will be given a number of cases in the input. Each case starts with a line containing n. This is followed by a line containing h. Next, there is a line of n integers specifying fi (1 <= i <=n), then a line of n integers di (1 <=i <=n), and finally, a line of n - 1 integers ti (1 <=i <=n - 1). Input is terminated by a case in which n = 0.
Output
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.
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.
Sample Input
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
Sample Output
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
思路:用优先队列装下每一个湖,然后模拟
AC-code:
#include<cstdio>#include<cstring>#include<queue>using namespace std;struct nod{int f,d,id;friend bool operator < (nod a,nod b){if(a.f==b.f)return a.id>b.id;return a.f<b.f;}}s[30],p;priority_queue<nod>q;int vis[30],cmp[30],tran[30];int main(){int n,t,tt,i,j,a,num,ans;while(~scanf("%d",&n)){if(n==0)break;scanf("%d",&t);t*=12;for(i=0;i<n;i++)scanf("%d",&s[i].f);for(i=0;i<n;i++){scanf("%d",&s[i].d);s[i].id=i;}tran[0]=0;for(i=1;i<n;i++){scanf("%d",&a);tran[i]=tran[i-1]+a;}ans=-1;memset(cmp,0,sizeof(cmp));for(i=0;i<n;i++){tt=t-tran[i];while(!q.empty())q.pop();for(j=0;j<=i;j++)q.push(s[j]);num=0;memset(vis,0,sizeof(vis));while(tt>0){p=q.top();q.pop();tt--;num+=p.f;p.f-=p.d;if(p.f<0) p.f=0;vis[p.id]++;q.push(p);}if(num>ans){ans=num;for(j=0;j<=i;j++)cmp[j]=vis[j];}}for(i=0;i<n-1;i++)printf("%d, ",5*cmp[i]);printf("%d\n",5*cmp[n-1]);printf("Number of fish expected: %d\n\n",ans); }return 0; }
0 0
- POJ 1042 Gone Fishing(贪心)
- poj 1042 Gone Fishing(贪心)
- POJ 1042:Gone Fishing【贪心】
- poj 1042 Gone Fishing(贪心)
- poj 1042 gone fishing 贪心+枚举
- poj 1042 Gone Fishing(贪心 钓鱼)
- POJ 1042 Gone Fishing(贪心+枚举)
- POJ 1042 Gone fishing(枚举+贪心)
- POJ 1042 Gone Fishing (贪心)
- POJ 1042 Gone Fishing(贪心+枚举)
- POJ-1042-Gone Fishing-枚举+贪心
- POJ 1042 Gone Fishing(模拟+贪心)
- POJ 1042 Gone Fishing 贪心 枚举
- poj 1042 Gone Fishing 枚举+贪心
- Poj-1042-Gone Fishing-枚举+贪心
- 1042 Gone Fishing //贪心
- POJ 1042 Gone Fishing
- poj 1042 Gone Fishing
- TypeScript学习2--基本类型
- 第一篇 (2016年2月10日)
- Android activity的生命周期
- Java学习笔记3-Swing监听器
- 英语序数词总结
- POJ 1042:Gone Fishing【贪心】
- TypeScript学习3--枚举类型
- Android 属性动画(Property Animation) 完全解析 (上)
- 第一行代码第5章——广播机制
- 顺序表应用6:有序顺序表查询
- [github]
- Java三大主流框架概述
- LA 3516 区间dp
- C#寒假学习笔记(4)