https://blog.youkuaiyun.com/lab103zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lab103/article/details/48222609https://blog.youkuaiyun.com/lab103/article/details/48222609lab103Sat, 05 Sep 2015 09:44:16 +0800https://blog.youkuaiyun.com/lab103/article/details/47950307https://blog.youkuaiyun.com/lab103/article/details/47950307lab103Mon, 24 Aug 2015 14:10:27 +0800https://blog.youkuaiyun.com/lab103/article/details/47857277https://blog.youkuaiyun.com/lab103/article/details/47857277lab103Sat, 22 Aug 2015 10:19:14 +0800int G[5][5], startx, starty, min; int A[5][5] = {1,1,1,1,1, 0,1,1,1,1, 0,0,-1,1,1, 0,0,0,0,1, 0,0,0,0,0}; int next[8][2] = {-2,-1, -2,1, -1,-2, -1,2,]]>https://blog.youkuaiyun.com/lab103/article/details/47836851https://blog.youkuaiyun.com/lab103/article/details/47836851lab103Fri, 21 Aug 2015 16:47:55 +0800b，a->c，b->a，b->c，c->a，c->b，总共六种方式。代码#include #include #include #d]]>https://blog.youkuaiyun.com/lab103/article/details/47810891https://blog.youkuaiyun.com/lab103/article/details/47810891lab103Thu, 20 Aug 2015 17:16:55 +0800https://blog.youkuaiyun.com/lab103/article/details/47779055https://blog.youkuaiyun.com/lab103/article/details/47779055lab103Wed, 19 Aug 2015 13:03:20 +0800https://blog.youkuaiyun.com/lab103/article/details/47731883https://blog.youkuaiyun.com/lab103/article/details/47731883lab103Mon, 17 Aug 2015 20:57:45 +0800 #]]>https://blog.youkuaiyun.com/lab103/article/details/47728737https://blog.youkuaiyun.com/lab103/article/details/47728737lab103Mon, 17 Aug 2015 18:14:37 +0800https://blog.youkuaiyun.com/lab103/article/details/47722849https://blog.youkuaiyun.com/lab103/article/details/47722849lab103Mon, 17 Aug 2015 11:31:34 +0800https://blog.youkuaiyun.com/lab103/article/details/47703201https://blog.youkuaiyun.com/lab103/article/details/47703201lab103Sun, 16 Aug 2015 16:15:35 +0800V，是一个虚点，表示所有点已经探测完毕 比较染点个数，保存结果 如果ihttps://blog.youkuaiyun.com/lab103/article/details/47397365https://blog.youkuaiyun.com/lab103/article/details/47397365lab103Mon, 10 Aug 2015 13:23:44 +0800 #include #define MAX_N 100005 using std::sort;int N, L, A[MAX_N];void solve() { sort(A, A+N); int l = 0, r = N-1, a = 0; while (l <= r) if]]>https://blog.youkuaiyun.com/lab103/article/details/47394991https://blog.youkuaiyun.com/lab103/article/details/47394991lab103Mon, 10 Aug 2015 10:31:14 +0800 #include #define MAX_N 1005 using std::sort;]]>https://blog.youkuaiyun.com/lab103/article/details/47381585https://blog.youkuaiyun.com/lab103/article/details/47381585lab103Sun, 09 Aug 2015 22:54:46 +0800 Lv25 ---B---> Lv30 ---C---> Lv60 ---D---> Lv75 需要完成的是从Lv1走向Lv75。这里选取A、B、C、D为主体，选取足够的经验球填充（或者选取当前经验为主体，每进一阶，将经验置为该阶的最低值，因为经验禁止溢出，也是因为这样所以放弃了这种考虑方式）。也就是说，需要挑选经验球来填A、B、C、D这四个经验池。 如]]>https://blog.youkuaiyun.com/lab103/article/details/47381357https://blog.youkuaiyun.com/lab103/article/details/47381357lab103Sun, 09 Aug 2015 22:41:13 +0800 #include #define MAX 20005 using std::sort;int H[MAX], C[MA]]>https://blog.youkuaiyun.com/lab103/article/details/47319873https://blog.youkuaiyun.com/lab103/article/details/47319873lab103Thu, 06 Aug 2015 17:08:19 +0800 #define MAX_N 5char G[MAX_N][MAX_N]; int N, max;bool check(int x, int y) { int next[4][2] = {{0,1}, {0,-]]>https://blog.youkuaiyun.com/lab103/article/details/47318579https://blog.youkuaiyun.com/lab103/article/details/47318579lab103Thu, 06 Aug 2015 16:09:50 +0800https://blog.youkuaiyun.com/lab103/article/details/47311927https://blog.youkuaiyun.com/lab103/article/details/47311927lab103Thu, 06 Aug 2015 09:53:14 +0800 #include #define MAX_V 55 #define MAX_E 1005int G[MAX_V][MAX_V], E, node[MAX_E][2], top;void dfs(int u) { for (int v = 1; v <]]>https://blog.youkuaiyun.com/lab103/article/details/47303187https://blog.youkuaiyun.com/lab103/article/details/47303187lab103Wed, 05 Aug 2015 20:45:48 +0800 #define MAX_N 11int n, res; int c[MAX_N], ans[MAX_N];void dfs(int cur) { if (cur == n+1) res++; else for (int i = 1; i <= n; i++) { c[cur] = i;]]>https://blog.youkuaiyun.com/lab103/article/details/47302031https://blog.youkuaiyun.com/lab103/article/details/47302031lab103Wed, 05 Aug 2015 19:22:45 +0800https://blog.youkuaiyun.com/lab103/article/details/47299287https://blog.youkuaiyun.com/lab103/article/details/47299287lab103Wed, 05 Aug 2015 16:23:18 +0800