07 2014 档案

poj-3067 Japan(树状数组)
摘要:Description Japan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the 阅读全文

posted @ 2014-07-24 16:34 huaihuaibuguai 阅读(137) 评论(0) 推荐(0) 编辑

BNUOJ-22868-Movie collection(树状数组)
摘要:Description Mr. K. I. has a very big movie collection. He has organized his collection in a big stack. Whenever he wants to watch one of the movies, h 阅读全文

posted @ 2014-07-24 16:22 huaihuaibuguai 阅读(448) 评论(0) 推荐(0) 编辑

Poj 1458 Common Subsequence(LCS)
摘要:Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., x 阅读全文

posted @ 2014-07-09 17:46 huaihuaibuguai 阅读(143) 评论(0) 推荐(0) 编辑

poj 1953 World Cup Noise
摘要:Description Background"KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their h 阅读全文

posted @ 2014-07-09 17:40 huaihuaibuguai 阅读(168) 评论(0) 推荐(0) 编辑

poj 1579 Moving Tables(水)
摘要:Description The Recaman's sequence is defined by a0 = 0 ; for m > 0, a m = a m−1 − m if the rsulting a m is positive and not already in the sequence, 阅读全文

posted @ 2014-07-09 17:33 huaihuaibuguai 阅读(107) 评论(0) 推荐(0) 编辑

poj 1676 What time is it?
摘要:Description An accutron shows time with four digits, from 0000 to 2359. Every digit is represented by 3*3 characters, including '|'s, '_'s and blanks. 阅读全文

posted @ 2014-07-05 15:29 huaihuaibuguai 阅读(397) 评论(0) 推荐(0) 编辑

poj 2393 Yogurt Factory(贪心)
摘要:Description The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk 阅读全文

posted @ 2014-07-05 12:01 huaihuaibuguai 阅读(248) 评论(0) 推荐(0) 编辑

poj 3190 Stall Reservations(贪心)
摘要:Description Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A 阅读全文

posted @ 2014-07-05 11:49 huaihuaibuguai 阅读(327) 评论(0) 推荐(0) 编辑

poj 2376 Cleaning Shifts
摘要:Description Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow 阅读全文

posted @ 2014-07-05 11:32 huaihuaibuguai 阅读(371) 评论(0) 推荐(0) 编辑

导航

点击右上角即可分享
微信分享提示