2013年03月_bai071006201

04月 03月

原创 Help Captain Chen Ⅰ

Description Recently, more and more students pay attention to a funny game called ACM, including Captain Chen. He finds that to compete in the Finals he must get a good rank in the Regionals

2013-03-22 09:57:26 550

原创 flody

参考文献 #include using namespace std; int MAX_DIS=999; int graph[50][50]; int dis[50][50]; int path[50][50]; int n; void flody() { int i,j,k; for(k=1;k<=n;k++) { for(int i=1;i<=n;i++) { for(

2013-03-21 14:45:53 628

原创并差集

Description Do you know a software called "WeiXin", a kind of chatting tool? There is an application called "Shaking for a while". Once you shake your cellphone, you can find those who shake their

2013-03-20 14:07:05 468

原创 poj 1068

#include #include #include #include #include using namespace std; void run(int a[],int t) { int i,j; vector vs; int visited[110]={0}; stack ss; vector result; for(i=1;i<=t;i++) { int s=a[i]-a

2013-03-19 15:37:56 370

原创 1328

#include #include using namespace std; float min(float a,float b) { return a<b?a:b; } int main() { int n,d; float a[1001][3]; float dis[1001][3]; int cs=0; cin>>n>>d; while(n!=0) { cs++; i

2013-03-17 20:31:58 376

原创图的深度搜索完整实现（邻接表，DFS）

//构造邻接表，深度优先搜索 #include #include #define null NULL using namespace std; typedef struct nd { int key; struct nd * next; }node; typedef struct ndl { int count; node * first; }nodelist; int n=6; node

2013-03-12 16:13:01 563

原创图的广度搜索完整实现（邻接表，队列，BFS）

//构造邻接表，队列，广度优先搜索 #include #include #define null NULL using namespace std; typedef struct nd { int key; struct nd * next; }node; typedef struct ndl { int count; node * first; }nodelist; typedef st

2013-03-12 15:41:03 544