2015 年 5月 6 日随笔档案 - _fukua

2015年5月6日

摘要： 1303. Minimal CoverageGiven set of line segments [Li, Ri] with integer coordinates of their end points. Your task is to find the minimal s... 阅读全文

posted @ 2015-05-06 23:36 _fukua 阅读(416) 评论(0) 推荐(0) 编辑

TImus 1167. Bicolored Horses DP

摘要： 1167. Bicolored HorsesTime limit: 1.0 secondMemory limit: 64 MBEvery day, farmer Ion (this is a Romanian name) takes out all his horses, so th... 阅读全文

posted @ 2015-05-06 18:11 _fukua 阅读(300) 评论(0) 推荐(0) 编辑

TImus 1073 Square Country DP

摘要：题意：给出一个数n(1 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 const int maxn=60000+3; 9 const int inf=0x3f3f3f3f;10 11 int dp[maxn];12 1... 阅读全文

posted @ 2015-05-06 15:01 _fukua 阅读(198) 评论(0) 推荐(0) 编辑