2011年10月4日

UVa-10020 Minimal coverage **

摘要： 1 /* 2 * Uva-10020 最少区间覆盖-贪心 3 * 4 * 很直接的贪心。。 详见刘汝佳 《奥赛入门经典》 5 * 6 * 测试数据： http://www.algorithmist.com/index.php/UVa_10020#Input 7 * 8 */ 9 10 #include <cstdio>11 #include <algorithm>12 using namespace std;13 14 const int maxN = 100000 + 5;15 int caseNum, m, intervalNum, ansList[maxN];16 阅读全文

posted @ 2011-10-04 23:32 龙豆 阅读(809) 评论(0) 推荐(0)

CEOI2001-Bitmap-黑书1.3.7 **

摘要： 题目：Components of a BitmapPROBLEMBlack and white pictures are usually stored as bitmaps. A bitmap is a rectangular grid of pixels.A polyline between pixels P and Q is a sequence of black pixels P=P1, P2, …, Pk=Q, where Pi and Pi+1 (i=1, …, k-1) are (vertically or horizontally) adjacent pi... 阅读全文

posted @ 2011-10-04 16:55 龙豆 阅读(607) 评论(0) 推荐(0)

导航