To be an ACMan

我靠，这么水的题目让我那么纠结，直到A了也不知道数据范围为多大。View Code #include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<queue>#define maxn 50005using namespace std;int cost[maxn],head[maxn];bool vis[maxn];long long dis[maxn];struct node{ int v,w,next;}list[maxn*2];in Read More

字符串处理+dijkstra修改一下View Code #include<stdio.h>#include<string.h>#define maxn 201int n,m,num;int dis[maxn],adj[maxn][maxn];bool vis[maxn];int MIN(int a ,int b){ return a < b ? a : b;}int MAX(int a, int b){ return a > b ? a :b;}char str[201][35],s[35];int find(){ int i; for(i=0;i<n Read More

写2个dijkstra，一个逆向一个顺向View Code #include<stdio.h>#include<string.h>#define maxn 1001#define INF 100000000int dis[maxn],adj[maxn][maxn],d[maxn];bool vis[maxn];int m, n;void dijkstra(int v) //顺向{ int i ,j ,k, u, min; for(i=0;i<=n;i++) { dis[i]=adj[v][i]; vis[i]=0; } vis[... Read More