https://blog.youkuaiyun.com/yc5_yczh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/yc5_yc/article/details/8510614https://blog.youkuaiyun.com/yc5_yc/article/details/8510614yc5_ycWed, 16 Jan 2013 18:30:52 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8497935https://blog.youkuaiyun.com/yc5_yc/article/details/8497935yc5_ycSun, 13 Jan 2013 13:40:37 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8245830https://blog.youkuaiyun.com/yc5_yc/article/details/8245830yc5_ycSat, 01 Dec 2012 10:37:01 +0800Int toint' :: Char->Int toint' s |s=='1' =1 |s=='2' =2 |s=='3' =3 |s=='4' =4 |s=='5' =5 |s=='6' =6 |s=='7' =7 |s=='8' =8 |s=='9' =9 |s=='0' =0 |otherwise = 0]]>https://blog.youkuaiyun.com/yc5_yc/article/details/8245250https://blog.youkuaiyun.com/yc5_yc/article/details/8245250yc5_ycFri, 30 Nov 2012 22:23:47 +0800Tree build (x,y)=if xhttps://blog.youkuaiyun.com/yc5_yc/article/details/8227702https://blog.youkuaiyun.com/yc5_yc/article/details/8227702yc5_ycMon, 26 Nov 2012 21:45:27 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8227523https://blog.youkuaiyun.com/yc5_yc/article/details/8227523yc5_ycMon, 26 Nov 2012 20:57:04 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8226949https://blog.youkuaiyun.com/yc5_yc/article/details/8226949yc5_ycMon, 26 Nov 2012 17:59:43 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8192435https://blog.youkuaiyun.com/yc5_yc/article/details/8192435yc5_ycFri, 16 Nov 2012 22:01:47 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8188689https://blog.youkuaiyun.com/yc5_yc/article/details/8188689yc5_ycThu, 15 Nov 2012 21:46:06 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/8108036https://blog.youkuaiyun.com/yc5_yc/article/details/8108036yc5_ycWed, 24 Oct 2012 17:21:33 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7984197https://blog.youkuaiyun.com/yc5_yc/article/details/7984197yc5_ycSun, 16 Sep 2012 12:15:01 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7909563https://blog.youkuaiyun.com/yc5_yc/article/details/7909563yc5_ycSun, 26 Aug 2012 17:55:48 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7802636https://blog.youkuaiyun.com/yc5_yc/article/details/7802636yc5_ycMon, 30 Jul 2012 16:37:56 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7784354https://blog.youkuaiyun.com/yc5_yc/article/details/7784354yc5_ycWed, 25 Jul 2012 13:37:58 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7624587https://blog.youkuaiyun.com/yc5_yc/article/details/7624587yc5_ycFri, 01 Jun 2012 20:54:08 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7617937https://blog.youkuaiyun.com/yc5_yc/article/details/7617937yc5_ycWed, 30 May 2012 21:36:22 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7607488https://blog.youkuaiyun.com/yc5_yc/article/details/7607488yc5_ycSun, 27 May 2012 21:34:19 +0800num=y;p->len=z;p->C=C;p->next=S[]]>https://blog.youkuaiyun.com/yc5_yc/article/details/7607266https://blog.youkuaiyun.com/yc5_yc/article/details/7607266yc5_ycSun, 27 May 2012 20:03:41 +0800https://blog.youkuaiyun.com/yc5_yc/article/details/7561098https://blog.youkuaiyun.com/yc5_yc/article/details/7561098yc5_ycSat, 12 May 2012 21:40:06 +08000, 那么显然b[j] = b[j-1] + a[j]，用之前最大的一个加上a[j]即可，因为a[j]必须包含如果b[j-1] int max = 0; int b[n+1]; int start = 0; int end =]]>https://blog.youkuaiyun.com/yc5_yc/article/details/7555132https://blog.youkuaiyun.com/yc5_yc/article/details/7555132yc5_ycThu, 10 May 2012 20:49:56 +0800