摘要:
裸线段树,没啥好说的,直接上Problem DescriptionFor the daily milking, Farmer John'sNcows (1 ≤N≤ 50,000) always line up in the same order. One day Farmer John decide... 阅读全文
摘要:
题目大意;说是可以吧一段区间变成白色或者黑色, 区间(0-10^9)初始都是白色,问经过n次操作以后最大的连续白色区间Problem DescriptionThe segment of numerical axis from 0 to 109is painted into white color. ... 阅读全文
摘要:
Just a Hook题目大意:原来有N个铜棍, 一个人有种能力可以把一个区间的棍变成铜,银或者金的,价值分别是1,2,3, 最后求出总价值,没啥好说的,赤裸裸的线段树; Time Limit : 4000/2000ms (Java/Other)Memory Limit : 32768/32768K... 阅读全文