码迷,mamicode.com
首页 >  
搜索关键字:battle    ( 273个结果
Codeforces Round #291 (Div. 2)——B<set>—— Han Solo and Lazer Gun
There arenImperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his ...
分类:其他好文   时间:2015-03-17 23:08:52    阅读次数:157
A1013. Battle Over Cities (25)
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that c...
分类:其他好文   时间:2015-03-11 18:42:08    阅读次数:150
1013. Battle Over Cities
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee...
分类:其他好文   时间:2015-03-11 14:57:06    阅读次数:154
PAT:1013. Battle Over Cities (25) AC
#include#include#includeusing namespace std;const int MAX=1010;int n,m,k; //城市数,高速公路数,查询次数int DELETE; //要删除的点vector ADJ[MAX]; //邻...
分类:其他好文   时间:2015-03-11 10:43:07    阅读次数:140
URAL 1991. The battle near the swamp
1991. The battle near the swamp Time limit: 1.0 second Memory limit: 64 MB Gungan: Jar Jar, usen da booma! Jar Jar: What? Mesa no have a booma! Gungan: Here. Taken dis one. In the ...
分类:其他好文   时间:2015-03-08 13:02:11    阅读次数:171
ZOJ 3623 Battle Ships DP
B - Battle Ships Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3623Appoint description:DescriptionBattl...
分类:其他好文   时间:2015-03-05 22:09:06    阅读次数:264
PAT1013. Battle Over Cities
1013. Battle Over Cities (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard 作者CHEN, YueIt is vitally important to have all the cities connected by hi...
分类:其他好文   时间:2015-02-27 11:41:27    阅读次数:100
1013. Battle Over Cities (25)
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee...
分类:其他好文   时间:2015-02-25 21:11:19    阅读次数:141
POJ 2312 Battle City(优先队列+BFS)
题目链接:http://poj.org/problem?id=2312 Battle City Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7085   Accepted: 2390 Description Many of us had playe...
分类:其他好文   时间:2015-02-09 23:08:15    阅读次数:206
hdu 5093 Battle ships 二分匹配
题意:在n×m的方格中,‘#’代表iceberg,'*'代表ocean,‘o’代表floating ice。战舰只能放在ocean上,在同一行或者同一列不能放两 个战舰除非它们中间有iceberg,求最多能放多少战舰。 思路:二分匹配。每行中连续为'*'的作为X集合中一个点,同样,将每列中连续为'*'的点作为Y集合中的一个点。对原图中每个'*',将其对应的X集合和Y集合中的标号建边,便形成...
分类:其他好文   时间:2015-02-02 18:19:09    阅读次数:122
273条   上一页 1 ... 20 21 22 23 24 ... 28 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!