hyccfy的专栏

#include #include using namespace std; #define N 100000 #define M 205 int map[M][M],d[M],v[M]; void Dijkstra(int k,int p) { int i,j,flag,min; for(i=0;i<k;i++) { d[i]=map[p][i]; v[i]=0; } d

一个人的旅行 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18399    Accepted Submission(s): 6394 Problem Description 虽然草儿是个路痴（就是在杭电待了一年多，居然

最短路 Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 30858    Accepted Submission(s): 13294 Problem Description 在每年的校赛里，所有进入决赛的同学都会获得一件很

Stockbroker Grapevine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 26859   Accepted: 14868 Description Stockbrokers are known to overreact to rumours. You

昂贵的聘礼 Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 36654   Accepted: 10560 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给