Forgetting - 博客园

2009年12月31日

摘要： Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28629Accepted Submission(s): 6070Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n]... 阅读全文

posted @ 2009-12-31 13:55 Forgetting 阅读(179) 评论(0) 推荐(1)

2009年12月30日

1001

摘要： Sum ProblemTime Limit: 1000/500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64700Accepted Submission(s): 14416Problem DescriptionHey, welcome to HDOJ(Hangzhou Dianzi ... 阅读全文

posted @ 2009-12-30 13:00 Forgetting 阅读(159) 评论(0) 推荐(0)

1000

摘要： 1000 A + B ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 75084Accepted Submission(s): 25252Problem DescriptionCalculate A + B.InputEach lin... 阅读全文

posted @ 2009-12-30 11:55 Forgetting 阅读(120) 评论(0) 推荐(1)

2009年7月22日

生成树

摘要：从一个结点开始DFS，BFS生成树#include<iostream>#include<fstream>#include<string>using namespace std;#define MAX 40#define Null 0int visited[MAX]; //0表示未访问，1表示已经访问ofstream out("DFS.txt"); typedef... 阅读全文

posted @ 2009-07-22 10:56 Forgetting 阅读(163) 评论(0) 推荐(0)

非递归遍历二叉树

摘要： #include<iostream>using namespace std;#define Stack_Init_Size 100#define StackIncrement 10#define NULL 0typedef struct BiTNode{char data;struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;typedef s... 阅读全文

posted @ 2009-07-22 10:55 Forgetting 阅读(291) 评论(0) 推荐(0)