https://blog.youkuaiyun.com/TA201314zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/TA201314/article/details/85097383https://blog.youkuaiyun.com/TA201314/article/details/85097383TA201314Wed, 19 Dec 2018 15:01:33 +0800https://blog.youkuaiyun.com/TA201314/article/details/78948477https://blog.youkuaiyun.com/TA201314/article/details/78948477TA201314Tue, 02 Jan 2018 02:43:44 +0800sx(j)]ans=\sum_{x=0}^{n-1}\sum_{1\le]]>https://blog.youkuaiyun.com/TA201314/article/details/78945265https://blog.youkuaiyun.com/TA201314/article/details/78945265TA201314Mon, 01 Jan 2018 13:19:14 +0800https://blog.youkuaiyun.com/TA201314/article/details/54016798https://blog.youkuaiyun.com/TA201314/article/details/54016798TA201314Wed, 04 Jan 2017 10:48:43 +0800i，那么就需要立刻从j到j-1直到i+1，然后再往后走。这样就相当于每个节点有]]>https://blog.youkuaiyun.com/TA201314/article/details/53975943https://blog.youkuaiyun.com/TA201314/article/details/53975943TA201314Mon, 02 Jan 2017 09:59:00 +0800https://blog.youkuaiyun.com/TA201314/article/details/53098577https://blog.youkuaiyun.com/TA201314/article/details/53098577TA201314Wed, 09 Nov 2016 12:47:28 +0800模拟一下样例/看看样例解释看看有没有读错题=>想]]>https://blog.youkuaiyun.com/TA201314/article/details/53088715https://blog.youkuaiyun.com/TA201314/article/details/53088715TA201314Tue, 08 Nov 2016 21:32:44 +0800https://blog.youkuaiyun.com/TA201314/article/details/53070808https://blog.youkuaiyun.com/TA201314/article/details/53070808TA201314Mon, 07 Nov 2016 20:45:05 +0800https://blog.youkuaiyun.com/TA201314/article/details/53026344https://blog.youkuaiyun.com/TA201314/article/details/53026344TA201314Thu, 03 Nov 2016 21:34:48 +0800https://blog.youkuaiyun.com/TA201314/article/details/53010637https://blog.youkuaiyun.com/TA201314/article/details/53010637TA201314Wed, 02 Nov 2016 18:53:29 +0800https://blog.youkuaiyun.com/TA201314/article/details/52875877https://blog.youkuaiyun.com/TA201314/article/details/52875877TA201314Fri, 21 Oct 2016 10:02:00 +0800pi+1](cpi+bpi+1)\sum_{i=1}^{n-1} \big|x_{p_i}-x_{p_{i+1}} \big|+[p_ip_{i+1}](c_{p_i}+b_{p_{i+1}})的最大值，要求p1=]]>https://blog.youkuaiyun.com/TA201314/article/details/52781125https://blog.youkuaiyun.com/TA201314/article/details/52781125TA201314Mon, 10 Oct 2016 19:54:03 +0800]]>https://blog.youkuaiyun.com/TA201314/article/details/52780989https://blog.youkuaiyun.com/TA201314/article/details/52780989TA201314Mon, 10 Oct 2016 19:35:34 +0800https://blog.youkuaiyun.com/TA201314/article/details/52753481https://blog.youkuaiyun.com/TA201314/article/details/52753481TA201314Sat, 08 Oct 2016 07:01:11 +08002j，便可以通过枚举一边选了几个得到。但是算错了复杂度以为是O(n3logn)O(n^3\log n)的。。（矩阵乘习惯了一倍增就感觉是三方挂logn。。）（没想到看了题解以后这竟然就是标算。。）然后又想，既然倍增是三次方的。。。那只能看看暴力转移了。f(i,j)]]>https://blog.youkuaiyun.com/TA201314/article/details/52650814https://blog.youkuaiyun.com/TA201314/article/details/52650814TA201314Sat, 24 Sep 2016 15:20:51 +0800https://blog.youkuaiyun.com/TA201314/article/details/52633802https://blog.youkuaiyun.com/TA201314/article/details/52633802TA201314Fri, 23 Sep 2016 08:24:07 +0800f(i+1,j,k)[aj>ai+1]−>f(i+1,j′,k+1)[j′>j][aj′≥max{amin(j′,i+1) max(j′,i+1)}]f(i,j,k)\\->f(i+1,j,k)[a_j>a]]>https://blog.youkuaiyun.com/TA201314/article/details/52593707https://blog.youkuaiyun.com/TA201314/article/details/52593707TA201314Tue, 20 Sep 2016 10:48:38 +0800https://blog.youkuaiyun.com/TA201314/article/details/52506505https://blog.youkuaiyun.com/TA201314/article/details/52506505TA201314Sun, 11 Sep 2016 21:18:14 +0800f(i+1,j,k+(hi+1−hi)(2j−o),o+1),o<2−∗]]>https://blog.youkuaiyun.com/TA201314/article/details/52506262https://blog.youkuaiyun.com/TA201314/article/details/52506262TA201314Sun, 11 Sep 2016 20:43:52 +0800https://blog.youkuaiyun.com/TA201314/article/details/52506172https://blog.youkuaiyun.com/TA201314/article/details/52506172TA201314Sun, 11 Sep 2016 20:28:53 +0800