栈--POJ 1363
2015-07-25 17:15
411 查看
A B C D E F G
A - 堆栈A
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice POJ
1363
Description
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 establish only a surface track. Moreover, it turned out that
the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track.
The local tradition is that every train arriving from the direction A continues in the direction B with coaches reorganized in some way. Assume that the train arriving from the direction A has N <= 1000 coaches numbered in increasing order 1, 2, ..., N. The
chief for train reorganizations must know whether it is possible to marshal coaches continuing in the direction B so that their order will be a1, a2, ..., aN. Help him and write a program that decides whether it is possible to get the required order of coaches.
You can assume that single coaches can be disconnected from the train before they enter the station and that they can move themselves until they are on the track in the direction B. You can also suppose that at any time there can be located as many coaches
as necessary in the station. But once a coach has entered the station it cannot return to the track in the direction A and also once it has left the station in the direction B it cannot return back to the station.
Input
The input consists of blocks of lines. Each block except the last describes one train and possibly more requirements for its reorganization. In the first line of the block there is the integer N described above. In each of the next lines of the block there
is a permutation of 1, 2, ..., N. The last line of the block contains just 0.
The last block consists of just one line containing 0.
Output
The output contains the lines corresponding to the lines with permutations in the input. A line of the output contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input. Otherwise it contains No. In addition,
there is one empty line after the lines corresponding to one block of the input. There is no line in the output corresponding to the last ``null'' block of the input.
Sample Input
Sample Output
参见;经典的栈http://www.cppblog.com/sixleaves/archive/2015/03/30/210195.aspx
A - 堆栈A
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice POJ
1363
Description
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 establish only a surface track. Moreover, it turned out that
the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track.
The local tradition is that every train arriving from the direction A continues in the direction B with coaches reorganized in some way. Assume that the train arriving from the direction A has N <= 1000 coaches numbered in increasing order 1, 2, ..., N. The
chief for train reorganizations must know whether it is possible to marshal coaches continuing in the direction B so that their order will be a1, a2, ..., aN. Help him and write a program that decides whether it is possible to get the required order of coaches.
You can assume that single coaches can be disconnected from the train before they enter the station and that they can move themselves until they are on the track in the direction B. You can also suppose that at any time there can be located as many coaches
as necessary in the station. But once a coach has entered the station it cannot return to the track in the direction A and also once it has left the station in the direction B it cannot return back to the station.
Input
The input consists of blocks of lines. Each block except the last describes one train and possibly more requirements for its reorganization. In the first line of the block there is the integer N described above. In each of the next lines of the block there
is a permutation of 1, 2, ..., N. The last line of the block contains just 0.
The last block consists of just one line containing 0.
Output
The output contains the lines corresponding to the lines with permutations in the input. A line of the output contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input. Otherwise it contains No. In addition,
there is one empty line after the lines corresponding to one block of the input. There is no line in the output corresponding to the last ``null'' block of the input.
Sample Input
5 1 2 3 4 5 5 4 1 2 3 0 6 6 5 4 3 2 1 0 0
Sample Output
Yes No Yes
参见;经典的栈http://www.cppblog.com/sixleaves/archive/2015/03/30/210195.aspx
//@author:yzj Date:2015/07/25 //sourse:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82493#problem/A #include <iostream> #include <cstdio> #include <stack> using namespace std; const int MAXN = 1005; int a[MAXN], n; int main() { //freopen("F:/yzj/cppCode/input.txt", "r", stdin); while(scanf("%d", &n) && n) { while(scanf("%d", &a[0]) && a[0]) { for(int i = 1; i < n; i++) { scanf("%d", &a[i]); } stack<int> s; int pb=0, pa = 1;bool flag = true; while(pb < n) { if(a[pb]==pa) { pa++;pb++; } else if(!s.empty() && a[pb]==s.top()) { s.pop();pb++; } else if(a[pb] > pa) { s.push(pa);pa++; } else { flag = false;break; } } if(flag) printf("Yes\n"); else printf("No\n"); } printf("\n"); } return 0; }
相关文章推荐
- iOS 小技巧及注意点(OC)
- 使用UnityEditor做工具
- jzmq安装
- 算法学习blog
- Maximum sum-动态规划
- MySQL Bub访问地址
- iOS传值之代理传值
- 大型网站的优化
- 异常在子父类覆盖中的体现
- C语言结构体(struct)常见使用方法 blog.csdn.net/huqinwei987/article/details/23625823
- poj 3278 BFS
- lr_convert_string_encoding: 对中文进行UTF-8转码
- 智能助手相伴,享受人机温情
- 一个经典的JDBC连接MySQL的程序
- 矩阵快速幂模板
- JavaScript中你所不知道的Object(二)--Function篇
- Win7 NSIS Error: error writing temporary file的解决方法
- Kotlin for Android (II)创建一个工程
- MIUI应用权限设置
- 果新专利暗示iPhone 7设计更接近iPhone 4