A Blog

摘要： 最短路，bellmanView Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>using namespace std;#define inf 0x3f3f3f3f#define maxn 100#define maxm 10000#define eps 10e-9int n, m, pre[maxn], edge[maxm][2];double d[maxm];double dist[maxn]; 阅读全文

摘要： bfsView Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 8struct Wall{ int s, e; int p; bool h;}wall[5];struct Point{ int x, y;}s, e, q[maxn * maxn];int n = 6;int step[maxn][maxn];int from[maxn][maxn];int dir[4][2] 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 25#define maxm 105char irr1[maxn][maxm], irr2[maxn][maxm];char st[maxm];int n, m;int getid(){ for (int i = 0; i < n; i++) if (strcmp(st, irr1[i]) == 0) ret 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 20int f[maxn];int n, ans;void input(){ ans = 0; getchar(); for (int i = 0; i < n; i++) { f[i] = 0; for (int j = 0; j < 25; j++) { char ch = getchar(); i 阅读全文

摘要： dp利用单调双向队列。类似sliding windows。View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 260struct Node{ int pos, a; Node() { } Node(int pp, int aa) : pos(pp), a(aa) { }} q[maxn];int n, sub, m;int f[maxn][maxn], fmax[maxn 阅读全文