Train Problem I 战?栈:战
来源:互联网 发布:windows修复助手 编辑:程序博客网 时间:2024/06/08 06:53
#include<stdio.h>#include<string.h>#include<algorithm>#include<stack>using namespace std;int main(){ int i,j,n,k,b[1000],m,l; char a[1000],c,s[1000]; stack<char> p; while(~scanf("%d",&n)) { k=i=j=m=0; scanf("%s %s",s,a); while(m<n) { p.push(s[m]);b[k++]=0; while(!p.empty()&&p.top()!=a[i]) { m++; p.push(s[m]); b[k++]=0; } m++; while(!p.empty()&&p.top()==a[i]) { p.pop(); b[k++]=1; i++; } } if(i==n) { printf("Yes.\n"); for(i=0;i<k;i++) { if(b[i]==0)printf("in\n"); else printf("out\n"); } } else { printf("No.\n"); while(!p.empty()) { p.pop(); } } printf("FINISH\n"); } return 0;}
点击打开链接
0 0
- Train Problem I 战?栈:战
- Train Problem I 栈
- hdoj1022------------------Train Problem I---栈
- Train Problem I(栈)
- NYOJ150 Train Problem I 【栈】
- hdu Train Problem I (栈 )
- Train Problem I(栈)
- HDU1022--Train Problem I(栈)
- hdu 1022 Train Problem I 栈
- Train Problem I hdu 1022 栈
- hdu 1022 Train Problem I(栈)
- hdu 1022 Train problem I(栈~~)
- NYOJ 150 Train Problem I 【栈】
- HDOJ1022 Train Problem I 栈模拟
- HDU 1022 Train Problem I 栈、队列
- NYOJ 150 Train Problem I STL栈
- hdu 1022 Train Problem I(栈)
- HDU 1022 Train Problem I (栈)
- 多线程下载图片(使用ExecutorService)
- Python 攻击没有开启静态化的 WordPress 站
- JS,Jquery获取各种屏幕的宽度和高度
- Android 获取网络图片
- Fedora20如何删除WPS-office并更新版本
- Train Problem I 战?栈:战
- [leetcode] 29 Divide Two Integers
- Android高级图片滚动控件,编写3D版的图片轮播器
- 正则表达式中 test、exec、match 方法区别
- poj1486 Sorting Slides 二分图匹配的必须边
- Ceph架构剖析(转载)
- Unable to execute dex: java.nio.BufferOverflowException. Check the Eclipse log for stack trace.
- Jenkins+Gradle+Android+多渠道包 (二)
- Grapefruit, Cottage Cheese