https://blog.youkuaiyun.com/linhan8zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/linhan8/article/details/12222605https://blog.youkuaiyun.com/linhan8/article/details/12222605linhan8Tue, 01 Oct 2013 18:38:07 +0800b?a:b int t,n; int dp[maxn] , a[maxn] ; int main () { scanf ]]>https://blog.youkuaiyun.com/linhan8/article/details/12222571https://blog.youkuaiyun.com/linhan8/article/details/12222571linhan8Tue, 01 Oct 2013 18:36:41 +0800https://blog.youkuaiyun.com/linhan8/article/details/12222557https://blog.youkuaiyun.com/linhan8/article/details/12222557linhan8Tue, 01 Oct 2013 18:33:46 +0800https://blog.youkuaiyun.com/linhan8/article/details/12222531https://blog.youkuaiyun.com/linhan8/article/details/12222531linhan8Tue, 01 Oct 2013 18:32:25 +0800 j  但 a[i] 由于题目中a[i] = i ; 那就简单地成为了一个经典 ” 最长上升子序列 “问题啦。 数据到了ｗ的级别，用　Ｏ（ｎｌｇｎ）的贪心方法做。 代码： #include #include using names]]>https://blog.youkuaiyun.com/linhan8/article/details/12222523https://blog.youkuaiyun.com/linhan8/article/details/12222523linhan8Tue, 01 Oct 2013 18:31:35 +0800https://blog.youkuaiyun.com/linhan8/article/details/12222499https://blog.youkuaiyun.com/linhan8/article/details/12222499linhan8Tue, 01 Oct 2013 18:30:46 +0800https://blog.youkuaiyun.com/linhan8/article/details/12222479https://blog.youkuaiyun.com/linhan8/article/details/12222479linhan8Tue, 01 Oct 2013 18:30:03 +0800https://blog.youkuaiyun.com/linhan8/article/details/12222401https://blog.youkuaiyun.com/linhan8/article/details/12222401linhan8Tue, 01 Oct 2013 18:25:34 +0800https://blog.youkuaiyun.com/linhan8/article/details/9193087https://blog.youkuaiyun.com/linhan8/article/details/9193087linhan8Fri, 28 Jun 2013 01:33:46 +0800https://blog.youkuaiyun.com/linhan8/article/details/8802303https://blog.youkuaiyun.com/linhan8/article/details/8802303linhan8Mon, 15 Apr 2013 09:38:02 +0800https://blog.youkuaiyun.com/linhan8/article/details/8746110https://blog.youkuaiyun.com/linhan8/article/details/8746110linhan8Mon, 01 Apr 2013 14:31:10 +0800https://blog.youkuaiyun.com/linhan8/article/details/8565600https://blog.youkuaiyun.com/linhan8/article/details/8565600linhan8Sat, 02 Feb 2013 18:32:53 +0800https://blog.youkuaiyun.com/linhan8/article/details/8141346https://blog.youkuaiyun.com/linhan8/article/details/8141346linhan8Fri, 02 Nov 2012 16:46:04 +0800https://blog.youkuaiyun.com/linhan8/article/details/8126668https://blog.youkuaiyun.com/linhan8/article/details/8126668linhan8Wed, 31 Oct 2012 01:49:52 +0800https://blog.youkuaiyun.com/linhan8/article/details/8080089https://blog.youkuaiyun.com/linhan8/article/details/8080089linhan8Wed, 17 Oct 2012 10:36:03 +0800https://blog.youkuaiyun.com/linhan8/article/details/8039169https://blog.youkuaiyun.com/linhan8/article/details/8039169linhan8Thu, 04 Oct 2012 10:48:20 +0800https://blog.youkuaiyun.com/linhan8/article/details/8011317https://blog.youkuaiyun.com/linhan8/article/details/8011317linhan8Mon, 24 Sep 2012 01:17:49 +0800https://blog.youkuaiyun.com/linhan8/article/details/8010195https://blog.youkuaiyun.com/linhan8/article/details/8010195linhan8Sun, 23 Sep 2012 17:34:30 +0800https://blog.youkuaiyun.com/linhan8/article/details/7972658https://blog.youkuaiyun.com/linhan8/article/details/7972658linhan8Wed, 12 Sep 2012 20:57:10 +0800https://blog.youkuaiyun.com/linhan8/article/details/7931746https://blog.youkuaiyun.com/linhan8/article/details/7931746linhan8Sat, 01 Sep 2012 11:23:33 +0800