摘要:
http://poj.org/problem?id=2240 之前看了红皮写的 #include<iostream>#include<cstdio>#include<cstring>using namespace std;const int MAXN=50;const int MAXL=1005;char str[MAXN][MAXL],strA[MAXL],strB[MAXL];lon... 阅读全文
摘要:
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3166 #include<stdio.h>#include<string.h>#define INF 0xfffffff#define N 102int map[N][N],hot[N],n,min,c;void floyd(){ int i,j,k,t; ... 阅读全文
摘要:
http://poj.org/problem?id=1860 好像当初百度了一下来着- -# #include<stdio.h>#include<string.h>int N,M,S,cnt;double V;struct edge{ int u,v; double r,c;}E[201];int bellman(){ int i, f; double d[110... 阅读全文
摘要:
http://poj.org/problem?id=1502 #include<stdio.h>#include<string.h>#include<stdlib.h>#define INF 0xffffff#define N 110int map[N][N],vis[N],dis[N],n,min;void dijkstra(int x){ int i,j,k; memset(v... 阅读全文
摘要:
http://poj.org/problem?id=1125 暴力下 #include<stdio.h>#define INF 0xfffffff#define N 200int map[N][N],t[N],n,min;void floyd(){ int i,j,k; for(k=1;k<=n;k++) for(i=1;i<=n;i++) fo... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2680 都是些入门的套套模版 #include<stdio.h>#include<string.h>#define INF 0xfffffff#define N 1002int map[N][N],dis[N],vis[N],n,m,min;void dijkstra(int s){ int i,... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1874 简单 #include<stdio.h>#include<string.h>#define INF 0xfffffff#define N 600int map[N][N],dis[N],vis[N],n,m,min;void dijkstra(int s,int t){ int i,j,k... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2112 字符串处理下,以前不会用find函数就自写了个 - -。。。 #include<stdio.h>#include<string.h>#define INF 0xfffffff#define N 600int map[N][N],vis[N],dis[N],m,min;char name[N... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2544 最短路径第一题 #include<stdio.h>#include<string.h>#define INF 0xfffffff#define N 600int map[N][N],vis[N],dis[N],n,m,min;void dijkstra(){ int i,j,k; m... 阅读全文