题意：
给出两种操作，一种是求区间漂亮子序列的和的最大值，另一个就是给指定的点改变值。
题目中最重要的一句话:A beautiful subsequence is a subsequence that all the adjacent pairs of elves in the sequence have a different parity of position....
分类：
其他好文 时间：
2015-08-16 23:05:59
阅读次数：
142
//1 a b 将a位置的数改为b
//0 a b 输出[a,b] 区间内的 maximum sum of beautiful subsequence
//A beautiful subsequence is a subsequence that all the adjacent pairs
//of elves in the sequence have a different parity of...
分类：
其他好文 时间：
2015-08-02 15:13:38
阅读次数：
141
1001. Magician (hdu5316)这个题目用到线段树来合并区间，题目有句话的意思A beautiful subsequence is a subsequence that all the adjacent pairs of elves in the sequence have a di...
分类：
其他好文 时间：
2015-07-30 11:09:28
阅读次数：
114
Let's play a game
Time Limit: 2 Seconds Memory Limit: 65536 KB
Elves from the Lothvain forest have created a very interesting game. The rules are very simple:
There are two players.
...
分类：
其他好文 时间：
2014-08-15 17:56:19
阅读次数：
251
