[NOIP2013]表达式求值

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
#define int long long
string s;
vector<string> st; 
stack<string> op;
stack<int> num;
map<string, int> w;

int get (string s) {
	int num = 0;
	for (auto t : s)
		num = num * 10 + t - '0';
	return num;
}

int cal () {
	w["+"] = 1, w["*"] = 2;
	cin >> s;
    for (auto t : st) {
        if (t == "+" || t == "*") {
            if (op.size() == 0)
            {
                op.push(t);
            }
            else {
                while (op.size() && w[op.top()] > w[t]) {
                    auto a = num.top(); num.pop();
                    auto b = num.top(); num.pop();
                    num.push((a * b)%10000);
                    op.pop();
                }
                op.push(t);
            }
        }
        else {
            num.push(get(t));
        }
    }  
    while (op.size() && op.top() == "*") {
                    auto a = num.top(); num.pop();
                    auto b = num.top(); num.pop();
                    num.push((a * b)%10000);
                    op.pop();
                }
    while(op.size()) {
          auto a = num.top(); num.pop();
                    auto b = num.top(); num.pop();
                    num.push((a + b)%10000);
                    op.pop();
        
    }
   return num.top();
}
void solve() {
    
	cin >> s;
   	for (int i = 0; i < s.size(); i ++) {
   		if (s[i] == '*' || s[i] == '+') {
   			string t = "";
   			t += s[i];
   			st.pb(t);
		}
		else {
			string t = "";

			while (i < s.size() && s[i] >= '0' && s[i] <= '9') {
				t += s[i];
				i ++;
			}
			st.pb(t);
			i --;
		}
	}
	cout << cal() % 10000 << endl;
}
signed main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

对于当前的字符串判断类型，然后按照后序遍历的顺序输出结点类型