堆栈和队列
Bigdz
新手一枚,大神们就不要来--------你懂得
展开
-
hdu-1022-Train Problem I
As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over t原创 2017-07-21 17:28:25 · 304 阅读 · 0 评论 -
uva-514-Rails(栈)
There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to e原创 2017-07-21 17:24:21 · 219 阅读 · 0 评论 -
uva-10935-Throwing cards away I
队列 #include using namespace std; int main() { int n; while(cin>>n && n) { if(n==1) { cout<<"Discarded cards:"<<endl; cout<<"Remaining card: 1原创 2017-07-21 13:45:04 · 170 阅读 · 0 评论 -
hdu-1372-Knight Moves(bfs和dfs)
题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1372 BFS: 从起始点开始,每次对于满足题意的点,进行不满足题意的判断并且标记上该点的该次的计数(有时,可能为0或1,对于本题就是从起点走到次点的步数)。我们可以想象出一步一层的结构。为了完成这部分的操作,我们需要使用队列来完成,它每次的对于该层的判断,满足先进先出的原原创 2017-07-25 09:14:12 · 297 阅读 · 0 评论