Graceful-Segment-Tree
文章平均质量分 81
Dwylkz
no best, but coordination
展开
-
PKU 2777 Count Color
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21363 Accepted: 6218 Description Chos原创 2011-07-31 21:31:22 · 514 阅读 · 0 评论 -
hdu 3397 Sequence operation
a disgusting seg-tree problem i have to maintain 6 varible for each node cc: cover color rv: reverse tag lc[i]: longgest cover length from left side of color i rc[i]: longgest cover length from r原创 2012-08-19 11:01:39 · 530 阅读 · 0 评论 -
hdu 4366 Successor
Interesting, I haven't seen this kind of transform before(it proves that i am remain a newbie). I try to slove it by using sorts of brute-force seg-tree-update method. Of course I would get a TLE.原创 2012-08-21 01:45:05 · 553 阅读 · 0 评论 -
hdu 4267 A Simple Problem with Integers
/* Intuitively, we can solve this problem by using segment-tree. As points we deal with are discrete, we should do some specail judge. Notice that k <= 10, so we can build 10 SGT or one SGT原创 2012-09-16 09:35:28 · 646 阅读 · 0 评论 -
PKU 1177 Picture
题目链接:http://poj.org/problem?id=1177 呢个系我第一次做线段树离散化求矩形周长并,参考左Var Bob:^Joy关于线段树既文章。8927215GZHU10061001061177Accepted1528K110MSC++3841B2011-07-原创 2011-07-19 12:01:41 · 1530 阅读 · 0 评论 -
PKU 1177 Picture .
Picture Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 7116 Accepted: 3711 Description A number of rectangular posters, photographs and other pictures of the s...2011-07-31 19:54:03 · 87 阅读 · 0 评论 -
PKU 2777 Count Color
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21363 Accepted: 6218 Description Chosen Problem Solving and Program design as an optional course, you a...2011-07-31 21:31:00 · 85 阅读 · 0 评论