- 博客(8)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 poj1258
#include using namespace std; #define INF 100000000 int edge[101][101], dis[101],n; bool check[101]; int Prim() { int i,j,k,min,sum = 0;
2011-07-07 16:56:13
256
原创 poj2253
用Dijkstra做的，据说还可用Floyd、Prim等做，这以后再尝试了。开始用c++输入是16ms，改成c的输入就0ms。。。。这样的优化，有点囧。代码如下：#include #include #include using namespace std; #define
2011-07-06 21:06:01
289
原创 poj2240
#include #include using namespace std; #define SIZE 40 double rate[SIZE][SIZE]; char name[SIZE][SIZE]; int n,m; bool floyd() {
2011-07-06 02:42:40
351
原创 poj2240
#include #include using namespace std; #define eps 1e-8 #define SIZE 40 double dist[SIZE]; char name[SIZE][SIZE]; int n,m; stru
2011-07-06 02:25:53
257
原创 poj1125
#include using namespace std; #define INF 1000000 #define SIZE 120 int stockers[SIZE][SIZE]; int s_size; void floyd() { int i,j
2011-07-05 16:41:56
287
原创 poj3259
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13908 Accepted: 4889DescriptionWhile exploring his many farms,
2011-07-04 22:40:42
281
原创 poj1860
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9620 Accepted: 3242DescriptionSeveral currency exchange
2011-07-04 19:42:05
259
原创 poj3126
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5801 Accepted: 3330DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that t
2011-07-04 13:04:12
273
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人