历年国际ACM比赛
文章平均质量分 85
PK0071
这个作者很懒,什么都没留下…
展开
-
2007年北欧ACM比赛A题(最小值最大,二分)
Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new co原创 2013-12-08 00:08:07 · 1543 阅读 · 0 评论 -
2006 ACM Northwestern European Programming Contest C题(二分求最大)
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a numberN of them, of various tastes and of various sizes. F of my friends are coming to my party and each of原创 2013-12-08 22:59:46 · 995 阅读 · 0 评论 -
立方体成像(2004年ACM国际大学生程序设计决赛第3题)
Your new company is build#include using namespace std;#define MAXN 10#define FOR(i, n) for (i = 0; i < (n); i++)int n;int i, j, k, p;int view[6][MAXN][MAXN]; //视图int cube[MAXN][MAXN][MAXN];/原创 2013-11-25 15:37:25 · 1769 阅读 · 0 评论 -
2007LA 3902 网络(树+贪心)
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=283&page=show_problem&problem=1903题意:在一个树状的网络中,提供VOD服务,叶子节点是客户端,其他是服务器,要减少网络延迟,所以要在其他的服务器也安装同样的服务,使得每台客户端到最近服务器的原创 2013-12-10 23:41:30 · 923 阅读 · 0 评论 -
ACM Regionals 2004 Europe - Southeastern 最大子矩阵(扫描法)
Bob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees, factories and buildin原创 2013-12-30 23:15:47 · 1214 阅读 · 0 评论 -
04年中欧ACM比赛
Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in t原创 2013-12-21 00:46:11 · 1208 阅读 · 0 评论 -
ACM Regionals 2006 :: Asia - Shanghai 遥远的银河(部分枚举+扫描+动态维护)
You are observing a distant galaxy using a telescope above the Astronomy Tower, and you think that a rectangle drawn in that galaxy whose edges are parallel to coordinate axes and contain maximum star原创 2016-03-19 23:18:42 · 681 阅读 · 0 评论