hdoj-2600 War (简单题)

本文介绍了一个简单的算法,用于从一系列给定的历史战争记录中找出指定范围内没有发生战争的最后一年。该算法通过读取战争开始和结束年份,确定在这个范围内哪一年之后再无战事。若所有年份均有战争,则输出特定提示。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

War

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


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.

      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!
 

题目链接

其实只要比较区间的首尾,如果在区间内,就将最大年份赋为战争年份的区间最小年减一。

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
    int i,j,m,n;
    char s[1005];
    int x,y;
    while(cin>>n)
    {
        int a,b;
        cin>>a>>b;
        while(n--)
        {
            cin>>x>>y;
            gets(s);
            if(b<=y&&b>=x)
            {
                b=x-1;
            }
        }
        if(b>=a)
            cout<<b<<endl;
        else
            cout<<"Badly!"<<endl;
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值