HDU 2600 War(水题 区间边排序+贪心)
来源:互联网 发布:网站编程入门 编辑:程序博客网 时间:2024/05/18 01:50
War
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2340 Accepted Submission(s): 818
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.
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:
Ai Bi Ni (A,B is integer, p <= A, B <= q, Ni is a String which is the ith war's name )
Represent that the ith War took place between year A and year B.
Each war described as follows:
Ai Bi Ni (A,B is integer, p <= A, B <= q, Ni 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
3100 200100 120 RtWar110 140 WeWar141 199 QqWar 1-600 600-600 600 Cool War
Sample Output
200Badly!</pre>//注意战争名含有空格的字符串 一直wa<br /><pre name="code" class="cpp">#include <iostream>#include <cstdio>#include <math.h>#include <string.h>#include <string>#include <algorithm>#include <stdlib.h>using namespace std;struct Range{int a,b;}r[100+10];bool cmp(Range x,Range y){if(x.b!=y.b)return x.b>y.b;elsereturn x.a>=y.a;}int main(){ int t,p,q,i; string s; while(scanf("%d",&t)==1){ scanf("%d%d",&p,&q); for(i=0;i<t;i++){ scanf("%d%d",&r[i].a,&r[i].b); getline(cin,s); if(r[i].a>r[i].b) swap(r[i].a,r[i].b);} sort(r,r+t,cmp); for(i=0;i<t;i++){ if(q>r[i].b) break; else q=min(q,r[i].a-1); } if(q>=p) printf("%d\n",q); else printf("Badly!\n"); }return 0;}
0 0
- HDU 2600 War(水题 区间边排序+贪心)
- HDU 2600 War 贪心水
- UVA 11729 Commando War(排序+贪心)
- UVA-11729 - Commando War(贪心、排序)
- UVa - 11729 - Commando War ( 排序+贪心 )
- UVa Commando War-11729(排序+贪心)
- hdu 4070 Phage War “动中找定” 贪心
- Saving HDU+排序+贪心
- HDU 2600 War
- War hdu 2600
- hdu 2600 War
- hdu 2600 War
- hdu 2600 war
- HDU 2600 war
- HDU acm 2600 war
- HDU 2600 War
- HDU 2600 War
- HDU 2600 War 哈希
- python笔记9
- 3D图形渲染管线
- Cannot start server. Server instance is not configured.
- SIFT特征提取分析
- Hibernate懒加载异常的解决与深刻分析
- HDU 2600 War(水题 区间边排序+贪心)
- 两段用php转义从而可以防止刷入的代码
- 使用phantomjs抓取JS动态生成的页面
- ZooKeeper实现分布式队列Queue
- BestCoder Round #53 (div.2) 1002 Rikka with Tree
- serverlet实现文件下载
- 解析Tomcat处理请求的类Connector<1>
- 网络流习题
- Git远程操作详解