https://blog.youkuaiyun.com/qq_24512331zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/qq_24512331/article/details/77118595https://blog.youkuaiyun.com/qq_24512331/article/details/77118595qq_24512331Sat, 12 Aug 2017 15:21:31 +0800y的顺序排序，然后构造一个函数求点集中一定]]>https://blog.youkuaiyun.com/qq_24512331/article/details/51871935https://blog.youkuaiyun.com/qq_24512331/article/details/51871935qq_24512331Sun, 10 Jul 2016 16:04:15 +0800https://blog.youkuaiyun.com/qq_24512331/article/details/51864720https://blog.youkuaiyun.com/qq_24512331/article/details/51864720qq_24512331Sat, 09 Jul 2016 00:11:31 +0800 #include #include #include #include #pragma warning(disable:4996) using namespace std; #define ll long long #define maxlen 100 int calculate(string s]]>https://blog.youkuaiyun.com/qq_24512331/article/details/51863632https://blog.youkuaiyun.com/qq_24512331/article/details/51863632qq_24512331Fri, 08 Jul 2016 20:07:38 +0800 #include #include<]]>https://blog.youkuaiyun.com/qq_24512331/article/details/51863102https://blog.youkuaiyun.com/qq_24512331/article/details/51863102qq_24512331Fri, 08 Jul 2016 18:09:45 +0800https://blog.youkuaiyun.com/qq_24512331/article/details/51607496https://blog.youkuaiyun.com/qq_24512331/article/details/51607496qq_24512331Tue, 07 Jun 2016 23:33:44 +0800https://blog.youkuaiyun.com/qq_24512331/article/details/51596014https://blog.youkuaiyun.com/qq_24512331/article/details/51596014qq_24512331Mon, 06 Jun 2016 15:42:52 +0800https://blog.youkuaiyun.com/qq_24512331/article/details/51595835https://blog.youkuaiyun.com/qq_24512331/article/details/51595835qq_24512331Mon, 06 Jun 2016 15:30:12 +0800 #include #define N 100005 int arr[N]; int ans[2][N]; using namespace std; bool solve(int len, int channel){ int left =]]>