摘要:
一点小变形就是了。。】#include<iostream> #include<cstdio> #define maxn 201 #define inf 999999 using namespace std; int n,m,mapp[maxn][maxn],dis[maxn],vis[maxn]; 阅读全文
摘要:
#include<cstdio> #include<iostream> #include<string.h> #include<cmath> #define maxn 105 #define inf 9999999 int vis[maxn],n;//用来表示点是否在集合里 int mincost[ 阅读全文
摘要:
include<cstdio> #include<iostream> #include<string.h> #include<cmath> #define maxn 105 #define inf 9999999 struct node { double x,y; }stu[maxn]; int v 阅读全文
摘要:
嗯 水水的#include <cstdio> #include <cmath> #include<iostream> #include <algorithm> using namespace std; const int maxn = 10000+10; int pre[maxn]; int n,m 阅读全文
摘要:
万恶的打表#include<stdio.h> #include<math.h> #include<stdlib.h> #include<string.h> #define INF 0x3f3f3f #define max 600+50 int map[max][max],visit[max],low 阅读全文
摘要:
同样的代码 每次交的结果都不一样#include<stdio.h> #include<string.h> #include<stdlib.h> #include<algorithm> #include<iostream> using namespace std; struct Node { int 阅读全文
摘要:
Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13229 Accepted Submission(s 阅读全文
摘要:
嗯 有广搜的意思 #include<cstdio> #include<iostream> #include<queue> #include<vector> #define maxn 1001 #define inf 9999999 using namespace std; struct vec // 阅读全文
摘要:
最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 55394 Accepted Submission(s): 24486 Problem D 阅读全文