Dwylkz

Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21363 Accepted: 6218DescriptionChos

a disgusting seg-tree problemi have to maintain 6 varible for each nodecc: cover colorrv: reverse taglc[i]: longgest cover length from left side of color irc[i]: longgest cover length from r

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.

/* 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

题目链接：http://poj.org/problem?id=1177 呢个系我第一次做线段树离散化求矩形周长并，参考左Var Bob:^Joy关于线段树既文章。8927215GZHU10061001061177Accepted1528K110MSC++3841B2011-07-

  PictureTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 7116 Accepted: 3711DescriptionA number of rectangular posters, photographs and other pictures of the s...

Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21363 Accepted: 6218DescriptionChosen Problem Solving and Program design as an optional course, you a...