2013年5月11日
NEFU 708 Longest Non-decreasing Substring(线段树+DP)
摘要： Longest Non-decreasing SubstringTime Limit 1000msMemory Limit 65536KdescriptionYou are given a string S no longer than 100,000 consisting of characters 0-9 only. And two kinds of operations will be performed on S: Flip i j: for each i #include #include #include #define lson t=rt[rson].lz)///中间可递减 .. 阅读全文
posted @ 2013-05-11 16:50 剑不飞 阅读(198) 评论(0) 推荐(0)