HDU 4070 + 赤裸裸的贪心~~

标签：style   blog   http   color   os   io   strong   ar   for   

　　　　　　　　　　　　　　　　　　　　　　　　　　J - Phage War

　　　　　　　　Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

　　Phage War is a little flash game. In this game, we want infect all cells by the transmission and breed of phages. 
Originally, there is a cell infected by phages and this cell can breed a new phage every second. You should know that only the new born phages can inject other cells. 

There are n cells around this cell, numbered from 1 to n. If there are Di phages reaching the i-th cell, the cell would be infected, and the phages journey will cost Ti seconds. To simplify it, we assume these phages will stay in this new cell and they can’t infect other cells. And the new cell cannot breed new phages and infect other cells. 
Can you tell me how much time it costs to infect all cells at least? 

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 using namespace std;
 5 const int MAXN = 100010;
 6 struct node{
 7     int d,t;
 8 };
 9 bool cmp(const node& a,const node& b){
10     return a.t > b.t;
11 }
12 node bug[MAXN];
13 int main()
14 {
15     int t,n,cas = 1;
16     cin>>t;
17     while(t--){
18         scanf("%d",&n);
19         for(int i = 1;i <= n;i++)
20             scanf("%d%d",&bug[i].d,&bug[i].t);
21         sort(bug + 1,bug + 1 + n,cmp);
22         int ans = 0,tmp,acum = 0;
23         for(int i = 1;i <= n;i++){
24             tmp = bug[i].d + bug[i].t + acum;
25             if(ans < tmp) ans = tmp;
26             acum += bug[i].d;
27         }
28         printf("Case %d: %d\n",cas++,ans);
29     }
30     return 0;
31 }

HDU 4070 + 赤裸裸的贪心~~

标签：style   blog   http   color   os   io   strong   ar   for   

原文地址：http://www.cnblogs.com/jusonalien/p/3945752.html