HDU 2600 War 贪心水

时间：2014-03-20 06:36:19 阅读：496 评论：0 收藏：0 [点我收藏+]

War

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1827 Accepted Submission(s): 669

Problem Description

War is the reciprical and violent application of force between hostile political entities aimed at bringing about a desired political end-state via armed conflict. War is an interaction in which two or more militaries have a “struggle of wills”. When qualified as a civil war, it is a dispute inherent to a given society, and its nature is in the conflict over modes of governance rather than sovereignty. War is not considered to be the same as mere occupation,murder or genocide because of the reciprical nature of the violent struggle, and the organized nature of the units involved.
War is also a cultural entity, and its practice is not linked to any single type of political organisation or society. Rather, as discussed by John Keegan in his “History Of Warfare”, war is a universal phenomenon whose form and scope is defined by the society that wages it.
bubuko.com,布布扣

Today we don‘t want to talk about war, rather than , I want you to tell me which year there was no war.

Input

For each test case, first input one integer N(1<= N <= 100), then two integers p and q (-6000000 <= p <= q <= 6000000) represent the starting year and the ending year in this case. Followed by N wars.
Each war described as follows:
A_i B_i N_i (A,B is integer, p <= A, B <= q, N_i is a String which is the ith war‘s name )
Represent that the ith War took place between year A and year B.

Output

Output one number represent which year there was no war in the range p and q, if there are not only one year, output the maximum year which there was no war. If all the year had war, just output "Badly!".

Sample Input

3
100 200
100 120 RtWar
110 140 WeWar
141 199 QqWar 
1
-600 600
-600 600 Cool War

Sample Output

200
Badly!

Author

WhereIsHeroFrom

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

给你一个大的区间，然后给你n个小的区间，让你求这个大的区间上最大的值没有被这些小区间覆盖。

//0MS	232K
#include<stdio.h>
#include<algorithm>
using namespace std;
char ss[107];
struct war
{
    int s,e;
}w[107];
int cmp(war a,war b)
{
    if(a.e==b.e)return a.s>b.s;
    return a.e>b.e;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int s,e;
        scanf("%d%d",&s,&e);
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&w[i].s,&w[i].e);
            gets(ss);
        }
        sort(w,w+n,cmp);//按照右面的区间从小到大排序
        if(e>w[0].e){printf("%d\n",e);continue;}
        e=w[0].s-1;
        int flag=0;
        for(int i=1;i<n;i++)
        {
            if(e>w[i].s&&e<w[i].e)
                e=w[i].s-1;
            else {flag=1;printf("%d\n",e-1);}
        }
        if(!flag)printf("Badly!\n");
    }
    return 0;
}

HDU 2600 War 贪心水,布布扣,bubuko.com

HDU 2600 War 贪心水

原文：http://blog.csdn.net/crescent__moon/article/details/21515607

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)