https://blog.csdn.net/u012797220zh-cnhttps://blog.csdn.net/https://blog.csdn.net/u012797220/article/details/48324441https://blog.csdn.net/u012797220/article/details/48324441u012797220Wed, 09 Sep 2015 22:07:01 +0800https://blog.csdn.net/u012797220/article/details/48314667https://blog.csdn.net/u012797220/article/details/48314667u012797220Wed, 09 Sep 2015 13:25:17 +0800https://blog.csdn.net/u012797220/article/details/48310959https://blog.csdn.net/u012797220/article/details/48310959u012797220Wed, 09 Sep 2015 09:23:04 +0800https://blog.csdn.net/u012797220/article/details/48295429https://blog.csdn.net/u012797220/article/details/48295429u012797220Tue, 08 Sep 2015 19:15:06 +0800https://blog.csdn.net/u012797220/article/details/48275135https://blog.csdn.net/u012797220/article/details/48275135u012797220Mon, 07 Sep 2015 22:40:40 +0800https://blog.csdn.net/u012797220/article/details/48273583https://blog.csdn.net/u012797220/article/details/48273583u012797220Mon, 07 Sep 2015 21:12:32 +0800https://blog.csdn.net/u012797220/article/details/48273405https://blog.csdn.net/u012797220/article/details/48273405u012797220Mon, 07 Sep 2015 21:05:06 +0800https://blog.csdn.net/u012797220/article/details/48211723https://blog.csdn.net/u012797220/article/details/48211723u012797220Fri, 04 Sep 2015 18:58:20 +0800https://blog.csdn.net/u012797220/article/details/48206815https://blog.csdn.net/u012797220/article/details/48206815u012797220Fri, 04 Sep 2015 09:34:52 +0800https://blog.csdn.net/u012797220/article/details/48198399https://blog.csdn.net/u012797220/article/details/48198399u012797220Thu, 03 Sep 2015 21:40:14 +0800=n/3; 故共有(n-1)/2-(n/3)+(n/3?0:1)种。 2、当b 此时若a+b>c 则a+b>c-1  如果a,b,c能构成三角形，则a,b,c-1也一定能够构成三角形。 反过来，如果a,b,c-1能够构成三角形，也即a+b>c-1 当a+b！=c时，一定能使a,b,c构成三角形。故可以通过dp[n-1]递推过]]>https://blog.csdn.net/u012797220/article/details/48193273https://blog.csdn.net/u012797220/article/details/48193273u012797220Thu, 03 Sep 2015 08:48:59 +0800https://blog.csdn.net/u012797220/article/details/48184053https://blog.csdn.net/u012797220/article/details/48184053u012797220Wed, 02 Sep 2015 21:37:26 +0800https://blog.csdn.net/u012797220/article/details/48177247https://blog.csdn.net/u012797220/article/details/48177247u012797220Wed, 02 Sep 2015 13:57:07 +0800https://blog.csdn.net/u012797220/article/details/48176539https://blog.csdn.net/u012797220/article/details/48176539u012797220Wed, 02 Sep 2015 12:39:36 +0800https://blog.csdn.net/u012797220/article/details/48140521https://blog.csdn.net/u012797220/article/details/48140521u012797220Mon, 31 Aug 2015 21:43:16 +0800https://blog.csdn.net/u012797220/article/details/48116327https://blog.csdn.net/u012797220/article/details/48116327u012797220Sun, 30 Aug 2015 23:53:35 +0800https://blog.csdn.net/u012797220/article/details/48031457https://blog.csdn.net/u012797220/article/details/48031457u012797220Thu, 27 Aug 2015 17:59:49 +0800https://blog.csdn.net/u012797220/article/details/48011289https://blog.csdn.net/u012797220/article/details/48011289u012797220Wed, 26 Aug 2015 21:57:21 +0800https://blog.csdn.net/u012797220/article/details/48000661https://blog.csdn.net/u012797220/article/details/48000661u012797220Wed, 26 Aug 2015 11:13:54 +0800https://blog.csdn.net/u012797220/article/details/47957157https://blog.csdn.net/u012797220/article/details/47957157u012797220Mon, 24 Aug 2015 20:35:32 +0800