N3verL4nd - 博客园

2013年5月18日

poj_2253Frogger &&poj_1797Heavy Transportation

摘要： Frogger Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20181 Accepted: 6542 Description Freddy Frog is sitting on a st... 阅读全文

posted @ 2013-05-18 15:47 N3verL4nd 阅读(127) 评论(0) 推荐(0)

树状数组

摘要：转载于：http://fqq11679.blog.hexun.com/21722866_d.html 树状数组武钢三中吴豪【引言】在解题过程中，我们有时需要维护一个数组的前缀和S[i]=A[1... 阅读全文

posted @ 2013-05-18 11:17 N3verL4nd 阅读(159) 评论(0) 推荐(0)

hdoj_2112

摘要： HDU Today Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9383 Accepted Submission(s)... 阅读全文

posted @ 2013-05-18 10:50 N3verL4nd 阅读(106) 评论(0) 推荐(0)

2013年5月16日

hdoj_1385Minimum Transport Cost

摘要： Minimum Transport Cost Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5392 Accepted Su... 阅读全文

posted @ 2013-05-16 21:33 N3verL4nd 阅读(126) 评论(0) 推荐(0)

hdoj_3665Seaside

摘要： Seaside Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 842 Accepted Submission(s): 59... 阅读全文

posted @ 2013-05-16 19:10 N3verL4nd 阅读(92) 评论(0) 推荐(0)

poj_3630Phone List

摘要： Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18645 Accepted: 5910 Description Given a list of phone numbe... 阅读全文

posted @ 2013-05-16 15:21 N3verL4nd 阅读(117) 评论(0) 推荐(0)

hdoj_1869

摘要：六度分离 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2404 Accepted Submission(s): 940 ... 阅读全文

posted @ 2013-05-16 14:32 N3verL4nd 阅读(125) 评论(0) 推荐(0)

2013年5月14日

hdoj_1800Flying to the Mars

摘要： Flying to the Mars Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7676 Accepted Submi... 阅读全文

posted @ 2013-05-14 20:49 N3verL4nd 阅读(131) 评论(0) 推荐(0)

2013年5月13日

hdoj_1075What Are You Talking About

摘要： What Are You Talking About Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 9376 Acc... 阅读全文

posted @ 2013-05-13 23:24 N3verL4nd 阅读(126) 评论(0) 推荐(0)

SPFA模版

摘要： const int MAXN = 1005;const int INF = 999999;int pre[MAXN];bool visited[MAXN];int dist[MAXN];int maps[MAXN][MAXN];int n;queue Q;void SPFA(int src){ ... 阅读全文

posted @ 2013-05-13 21:23 N3verL4nd 阅读(130) 评论(0) 推荐(0)

晚晴小筑

Talk is cheap. Show me the code.

公告