https://blog.youkuaiyun.com/DQiuLinzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/DQiuLin/article/details/77477010https://blog.youkuaiyun.com/DQiuLin/article/details/77477010DQiuLinTue, 22 Aug 2017 10:34:45 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77471451https://blog.youkuaiyun.com/DQiuLin/article/details/77471451DQiuLinTue, 22 Aug 2017 09:49:43 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77427212https://blog.youkuaiyun.com/DQiuLin/article/details/77427212DQiuLinSun, 20 Aug 2017 10:55:17 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77338455https://blog.youkuaiyun.com/DQiuLin/article/details/77338455DQiuLinThu, 17 Aug 2017 19:15:12 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77266212https://blog.youkuaiyun.com/DQiuLin/article/details/77266212DQiuLinWed, 16 Aug 2017 19:16:39 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77245635https://blog.youkuaiyun.com/DQiuLin/article/details/77245635DQiuLinWed, 16 Aug 2017 13:58:04 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77199212https://blog.youkuaiyun.com/DQiuLin/article/details/77199212DQiuLinTue, 15 Aug 2017 19:55:54 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77163431https://blog.youkuaiyun.com/DQiuLin/article/details/77163431DQiuLinMon, 14 Aug 2017 16:41:21 +0800https://blog.youkuaiyun.com/DQiuLin/article/details/77163351https://blog.youkuaiyun.com/DQiuLin/article/details/77163351DQiuLinMon, 14 Aug 2017 16:36:39 +0800 #include using namespace std;const int MAXN=10008;//如果MAXN=100000008，则kk数组开不出，why? int n,m,k; int kk[MAXN*MAXN];int binary_search(int x)//二分查找，降低复杂度 { int begin=0,end=n*n]]>https://blog.youkuaiyun.com/DQiuLin/article/details/76355438https://blog.youkuaiyun.com/DQiuLin/article/details/76355438DQiuLinSat, 29 Jul 2017 20:05:50 +0800