http://poj.org/problem?id=3020 #include<cstdio> #include<cstring> #include<algorithm> #define maxn 1000 using namespace std; int t,n,m; char g[maxn][maxn]; int map1[maxn][maxn]; int gg[maxn][maxn]; bool vis[maxn]; int match[maxn]; ][]={{…
原题传送:http://poj.org/problem?id=3020 Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking…
http://poj.org/problem?id=3020 Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7565 Accepted: 3758 Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile ph…
http://poj.org/problem?id=2762 Going from u to v or from v to u? Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12733 Accepted: 3286 Description In order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has…
题目链接 : http://poj.org/problem?id=3020 Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery of a new…
题目地址:http://poj.org/problem?id=1170 Description In a shop each kind of product has a price. For example, the price of a flower is 2 ICU (Informatics Currency Units) and the price of a vase is 5 ICU. In order to attract more customers, the shop introd…
Sum It Up Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 4 Accepted Submission(s) : 1 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Given a specified total t and…
链接: http://poj.org/problem?id=3020 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=22010#problem/M Antenna Placement Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5500 Accepted: 2750 Description The Global Aerial Research Centr…
