栈
ujn20161222
persistence
展开
-
2018_2_3_Boolean Expressions_栈_模拟
注意处理'('前的 '!',设置优先级 Boolean Expressions Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4697 Accepted: 1461 Description The objective of the program you a原创 2018-02-03 17:37:26 · 181 阅读 · 0 评论 -
2018_2_3A Stack or A Queue?_栈队列基础题
Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one. Here comes the problem:原创 2018-02-03 17:58:29 · 234 阅读 · 0 评论 -
2018_2_3_I Can Guess the Data Structure!_STL_模拟
https://vjudge.net/problem/UVA-11995#include #include #include #include using namespace std; const int N=1000+10; int n; int op[N],x[N]; int main(){ while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i原创 2018-02-03 21:56:08 · 575 阅读 · 0 评论 -
2018_2_4_City Skyline_栈应用_STL_数大楼
s.push(0)不错 City Skyline Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3027 Accepted: 1391 Description The best part of the day for Farmer John's cows is原创 2018-02-04 21:02:02 · 150 阅读 · 0 评论 -
2018_2_5_Anagrams by Stack_栈_模拟_回溯_递归
How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT: [ i i i i o o o o i o i i o o i o ] where i stands原创 2018-02-05 08:38:42 · 203 阅读 · 0 评论