随笔分类 -  URAL

URAL 1152 Faise Mirrors 状压DP 简单题
摘要:1152. False MirrorsTime limit: 2.0 secondMemory limit: 64 MBBackgroundWe wandered in the labyrinth for twenty minutes before finally entering the larg... 阅读全文
posted @ 2015-06-03 00:08 _fukua 阅读(267) 评论(0) 推荐(0)
URAL 1039 Anniversary Party 树形DP 水题
摘要:1039. Anniversary PartyTime limit: 0.5 secondMemory limit: 8 MBBackgroundThe president of the Ural State University is going to make an 80'th Annivers... 阅读全文
posted @ 2015-06-01 23:13 _fukua 阅读(242) 评论(0) 推荐(0)
URAL 1018 Binary Apple Tree 树形DP 好题 经典
摘要:1018. Binary Apple TreeTime limit: 1.0 secondMemory limit: 64 MBLet's imagine how apple tree looks in binary computer world. You're right, it looks ju... 阅读全文
posted @ 2015-06-01 14:55 _fukua 阅读(263) 评论(0) 推荐(0)
URAL 1244 Gentlement DP +记录路径 好题
摘要:1244. GentlemenTime limit: 0.5 secondMemory limit: 64 MBLet's remember one old joke:Once a gentleman said to another gentleman:— What if we play cards... 阅读全文
posted @ 2015-05-31 22:05 _fukua 阅读(432) 评论(0) 推荐(0)
Timus 1303 Minimal Coverage DP或贪心
摘要: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 阅读(453) 评论(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 阅读(323) 评论(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 阅读(218) 评论(0) 推荐(0)
timus 1225 flags 基础DP 简单递推
摘要:1225. FlagsTime limit: 1.0 secondMemory limit: 64 MBOn the Day of the Flag of Russia a shop-owner decided to decorate the show-window ... 阅读全文
posted @ 2015-04-27 22:28 _fukua 阅读(268) 评论(0) 推荐(0)