摘要：
#include<iostream> #include<stdio.h> #include<queue> using namespace std; const int maxx = 105; const int INF = 99999999; int map[maxx][maxx],dist[max 阅读全文
摘要：
Arbitrage Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6414 Accepted Submission(s): 2966 Probl 阅读全文
摘要：
A - Theatre Square Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 1A A - Theatre Square Submit 阅读全文
摘要：
Shortest path of the king time limit per test 1 second memory limit per test 64 megabytes input standard input output standard output The king is left 阅读全文
摘要：
map感觉是非常方便的。 以后有其他的再更新。 阅读全文
摘要：
Winner Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 2A Winner Submit Status Practice CodeFor 阅读全文
摘要：
for(int k=1; k<=n; k++) for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) { gra[i][j]=min(gra[i][j],gra[i][k]+gra[k][j]); } void Dijkstra(int n, int v, 阅读全文
摘要：
HDU Today Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22939 Accepted Submission(s): 5485 Pro 阅读全文
摘要：
//#include<bits/stdc++.h> #include<algorithm> #include<stdio.h> #include<iostream> using namespace std; const int maxx=1000000*2+10; struct Node { int 阅读全文
摘要：
package test; import java.util.List; import java.util.ArrayList; import java.util.Scanner; import sun.net.www.content.audio.x_aiff; /** * @author 年浩 * 阅读全文