UVA 11995 I Can Guess the Data Structure!【模拟】
2015-08-17 18:05
495 查看
题目链接:
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3146
题意:
给定一堆的操作,问这个数据结构是什么
代码:
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3146
题意:
给定一堆的操作,问这个数据结构是什么
代码:
[code]#include <stdio.h> #include <iostream> #include <algorithm> #include <string.h> #include <queue> #include <stack> using namespace std; int n; int a, b; queue<int> que; stack<int> st; priority_queue<int>que1; int main() { while (~scanf("%d", &n)) { while (!que.empty()) que.pop(); while (!st.empty()) st.pop(); while (!que1.empty()) que1.pop(); int ok1 = 1, ok2 = 1, ok3 = 1; int cnt = 3; for (int i = 1; i <= n; i++) { scanf("%d%d", &a, &b); if (a == 1) { que.push(b); st.push(b); que1.push(b); } else { if ((que.empty() || b != que.front()) && ok1) { ok1 = 0; cnt--; } if ((st.empty() || b != st.top()) && ok2) { ok2 = 0; cnt--; } if ((que1.empty() || b != que1.top()) && ok3) { ok3 = 0; cnt--; } if (!que.empty()) que.pop(); if (!st.empty()) st.pop(); if (!que1.empty()) que1.pop(); } } if (cnt == 0) printf("impossible\n"); else if (cnt > 1) printf("not sure\n"); else { if (ok1) printf("queue\n"); else if(ok2) printf("stack\n"); else printf("priority queue\n"); } } return 0; }
相关文章推荐
- 使用query参数过滤组合AWS CLI输出信息
- UE4 Material Properties
- Android Studio Building 'xxx' Gradle project info
- UE3 材质概述
- EasyUI DataGrid 复选框
- 关于InvokeRequired与Invoke
- 解决Bui框架下拉框select配合Gird弹出模态编辑框使用,无法选取编辑行的下拉内容.
- POJ2533-Longest Ordered Subsequence
- Amazon UI 学习笔记
- 线段树专题—HDU 4027 Can you answer these queries?
- easyui-validatebox 验证两次密码是否输入一致
- How To Get Log, Trace Files In OA Framework Pages And Concurrent Request Programs
- How To Get Log, Trace Files In OA Framework Pages And Concurrent Request Programs
- How To Get Log, Trace Files In OA Framework Pages And Concurrent Request Programs
- hadoop序列文件读与写 (SequenceWriteReadFile)
- Easyui combobox如何默认选中第一项???
- [leetcode][deque] Sliding Window Maximum
- IOS UI简单的控件位置/尺寸/旋转变换
- PAT 1041. Be Unique (20)
- PAT 1085. Perfect Sequence (25)