1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T6b8,#include using namespace std; #define int long long // Function to apply an operator to two numbers int applyOp(int a, int b, char op) { switch (op) { case '+': return a + b; case '-': return a - b; case '*': return a * b; } return 0; } int evaluatePostfix(const vector& postfix) { stack values; for (const string& token : postfix) { if (isdigit(token[0])) { values.push(stoi(token)); } else { int b = values.top(); values.pop(); int a = values.top(); values.pop(); values.push(applyOp(a, b, token[0])); } } return values.top(); } int32_t main() { cin.tie(0)->sync_with_stdio(0); int N; cin >> N; string s; cin >> s; int OP = N / 2; int ans = INT_MIN; for(int bm=0; bm<(1< post = {{s[0]}}; vector> ops; for(int i=0; i= prec) { post.push_back({ops.back().first}); ops.pop_back(); } ops.push_back({s[2*i+1], prec}); post.push_bac

코드 #4594