uva-11111-棧

注意輸入和輸出的結(jié)果

?

-9 -7 -2 2 -3 -2 -1 1 2 3 7 9
-9 -7 -2 2 -3 -1 -2 2 1 3 7 9
-9 -7 -2 2 -3 -1 -2 3 2 1 7 9
-100 -50 -6 6 50 100
-100 -50 -6 6 45 100
-10 -5 -2 2 5 -4 -3 3 4 10
-9 -5 -2 2 5 -4 -3 3 4 9
-10 -5 -3 3 -1 1 5 -4 4 10

10
-10 10

-10

?

:-) Matrioshka!
:-( Try again.
:-( Try again.
:-) Matrioshka!
:-( Try again.
:-) Matrioshka!
:-( Try again.
:-) Matrioshka!
:-( Try again.
:-) Matrioshka!
:-( Try again.

#include <iostream> #include <sstream> #include<memory.h> #include<stdio.h> using namespace std; const int N = 10000; struct stack {int a[N];int index;stack(){index = 0;}void push(int i){a[index++] = i;}int pop(){int i = a[--index];return i;} }; int main() {int n;string str;while (getline(cin, str)){istringstream is(str);int hasInt = 0;stack s;memset(s.a, 0, sizeof(s.a));int error = 0;while (is >> n){hasInt++;if (n < 0)s.push(n);else{int t = 0;while (s.index){int j = s.pop();if (j > 0)t += j;else{if (j != n * -1)error = 1;break;}}if (t < n && !error)s.push(n);elsebreak;}}if (!hasInt){//cout << ":-( Try again." << endl;continue;}if (hasInt == 1){cout << ":-( Try again." << endl;continue;}if (error || s.index != 1)cout << ":-( Try again." << endl;else if (s.index == 1){if (s.pop() > 0)cout << ":-) Matrioshka!" << endl;elsecout << ":-( Try again." << endl;}}return 0; }

?

posted on 2017-08-11 14:25 好吧,就是菜菜 閱讀(...) 評論(...) 編輯 收藏

轉(zhuǎn)載于:https://www.cnblogs.com/shuiyonglewodezzzzz/p/7345754.html

總結(jié)

以上是生活随笔為你收集整理的uva-11111-栈的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。