- 博客(5)
- 收藏
- 关注
原创 uva 816 有点复杂的BFS和宽度优先搜索模板 Abbott's Revenge
The 1999 World Finals Contest included a problem based on a dice maze. At the time the problem was written, the judges were unable to discover the original source of the dice maze concept. Shortly a
2017-04-04 16:40:22 536 1
原创 HDU 2072 字符串处理(判重)
单词数 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 51348 Accepted Submission(s): 12629 Problem Description lily的好朋友xiaoou333最
2017-04-04 01:08:07 270
原创 HDU 1088 输入输出格式题
Write a simple HTML Browser Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11882 Accepted Submission(s): 3421 Problem Description I
2017-04-03 16:56:06 428
原创 HDU-1285 拓扑排序(入门)
确定比赛名次 Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24829Accepted Submission(s): 9971 Problem Description 有N个比赛队(1<=N<...
2017-03-27 17:48:16 352
原创 NOJ-1401 乘车费用 题解要点
这是我的第一道动态规划题目其实质是一个 带权的 固定路的 DAG 问题以下是初学DP解题时容易犯的一些错误和要点 1.状态转移方程 d(i)=min{d(i),d(n-i)+w(i)} 2.求取最短路时解的数组应初始化为无穷大 3.此题必要的初始启动条件(边界条件)(不同的题有不同的条件)就本体而言初始为d[0]=0(0公里时费用为0) 4.条件转移 d(0)->d(n) 答案保留在d[n]处
2017-03-16 21:40:25 259
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人