摘要：
http://poj.org/problem?id=2456 Description Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a st 阅读全文
摘要：
http://poj.org/problem?id=1258 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connecti 阅读全文
摘要：
http://poj.org/problem?id=1703 Description The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs 阅读全文
摘要：
http://poj.org/problem?id=2421 There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can 阅读全文
摘要：
http://poj.org/problem?id=1287 You are assigned to design network connections between certain points in a wide area. You are given a set of points in 阅读全文
摘要：
#include using namespace std; const int maxn = 5e5 + 10; int h[maxn], v[maxn], nx[maxn], in[maxn]; int n, m, sz; void add(int a, int b) { v[sz] = b; nx[sz] = h[a]; h[a] = sz; in[b] ++; s... 阅读全文
摘要：
http://poj.org/problem?id=1251 The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads 阅读全文
摘要：
http://poj.org/problem?id=1797 Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. 阅读全文
摘要：
http://poj.org/problem?id=2387 Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes 阅读全文
摘要：
http://acm.ocrosoft.com/problem.php?cid=1316&pid=8 题目描述 浙江杭州某镇共有n个人,请找出该镇上的前m个大富翁. 浙江杭州某镇共有n个人,请找出该镇上的前m个大富翁. 输入 输入包含多组测试用例. 每个用例首先包含2个整数n（0<n<=100000 阅读全文