Uva11729 Commando War

“Waiting for orders we held in the wood, word from the front never came By evening the sound of the gunfire was miles away Ah softly we moved through the shadows, slip away through the trees Crossing their lines in the mists in the fields on our hands and our knees And all that I ever, was able to see The fire in the air, glowing red, silhouetting the smoke on the breeze” There is a war and it doesn’t look very promising for your country. Now it’s time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. You have N soldiers in your squad. In your master-plan, every single soldier has a unique responsibility and you don’t want any of your soldier to know the plan for other soldiers so that everyone can focus on his task only. In order to enforce this, you brief every individual soldier about his tasks separately and just before sending him to the battlefield. You know that every single soldier needs a certain amount of time to execute his job. You also know very clearly how much time you need to brief every single soldier. Being anxious to finish the total operation as soon as possible, you need to find an order of briefing your soldiers that will minimize the time necessary for all the soldiers to complete their tasks. You may assume that, no soldier has a plan that depends on the tasks of his fellows. In other words, once a soldier begins a task, he can finish it without the necessity of pausing in between. Input There will be multiple test cases in the input file. Every test case starts with an integer N (1 ≤ N ≤ 1000), denoting the number of soldiers. Each of the following N lines describe a soldier with two integers B (1 ≤ B ≤ 10000) & J (1 ≤ J ≤ 10000). B seconds are needed to brief the soldier while completing his job needs J seconds. The end of input will be denoted by a case with N = 0. This case should not be processed. Output For each test case, print a line in the format, ‘Case X: Y ’, where X is the case number & Y is the total number of seconds counted from the start of your first briefing till the completion of all jobs. Sample Input 3 2 5 3 2 2 1 3 3 3 4 4 5 5 0 Sample Output Case 1: 8 Case 2: 15

【题解】

可以肯定，交代任务的时间是一定的。

我们把每个任务的交代和完成时间画一个柱状图，红色代表交代时间，蓝色代表执行时间

不难发现最终完成时间取决于黄色线条伸出的部分

因此越长的蓝色越靠前越好

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 #include <cstdlib>
 5 #include <cstring>
 6 #define max(a, b) ((a) > (b) ? (a) : (b))
 7 #define min(a, b) ((a) < (b) ? (a) : (b))
 8 inline void swap(int &a, int &b)
 9 {
10     int tmp = a;a = b;b = tmp;
11 }
12 inline void read(int &x)
13 {
14     x = 0;char ch = getchar(), c = ch;
15     while(ch < '0' || ch > '9')c = ch, ch = getchar();
16     while(ch <= '9' && ch >= '0')x = x * 10 + ch - '0', ch = getchar();
17     if(c == '-')x = -x;
18 }
19 
20 const int MAXN = 1000 + 10;
21 
22 struct Node
23 {
24     int b,j;
25 }node[MAXN];
26 
27 int cmp(Node a, Node b)
28 {
29     return a.j > b.j;
30 }
31 
32 int n; 
33 
34 int main()
35 {
36     int t = 0;
37     while(scanf("%d", &n) != EOF && n)
38     {
39         ++ t;
40         for(register int i = 1;i <= n;++ i)
41             read(node[i].b), read(node[i].j);
42         std::sort(node + 1, node + 1 + n, cmp);
43         int ma = 0, now = 0;
44         for(register int i = 1;i <= n;++ i)
45             now += node[i].b, ma = max(ma, now + node[i].j);
46         printf("Case %d: %d\n", t, ma);
47     }
48     return 0;
49 }

Uva11729

 

转载于:https://www.cnblogs.com/huibixiaoxing/p/7672462.html