online_judge_1366
来源:互联网 发布:淘宝详情页图片宽度 编辑:程序博客网 时间:2024/05/19 15:42
#include <iostream>#include <cstdio>#include <stack>using namespace std;bool isPopOrder(const int *a, const int *b, int n){ stack<int> st; int i,j; st.push(a[0]); for(i=1,j=0; j<n; ++j) { if(st.empty()) st.push(a[i++]); while(b[j] != st.top()) { if(i == n) return false; st.push(a[i++]); } st.pop(); } return true;}int main(){ int n,i; int *a,*b; while(EOF != scanf("%d", &n)) { a = new int[n]; b = new int[n]; for(i=0; i<n; ++i) { scanf("%d", &a[i]); } for(i=0; i<n; ++i) { scanf("%d", &b[i]); } if(isPopOrder(a,b,n)) printf("Yes\n"); else printf("No\n"); delete b; delete a; } return 0;}
0 0
- online_judge_1366
- Benches(排列组合)
- CentOS7下添加win7启动项
- WEB高性能解决方案
- PAT (Advanced Level) Practise 1052 Linked List Sorting (25)
- CTO技术管理
- online_judge_1366
- ios名人博客
- 计算机网络,物理层,初步理解
- linux下如何模拟按键输入和模拟鼠标
- 【IPC】Posix消息队列
- 机器学习 (笔记)牛顿方法
- 将java程序释出为可执行文件
- java.lang.NullPointerException at com.sun.org.apache.xerces.internal.impl.XMLDocumentFragmen
- 有关HTTPS和S-HTTP