UVA 12902 Reverse Polish Notation

//跟wyr学的
//其实是贪心
//题解稍后补上

 #include<cstdio>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<cstring>
 #include<cstdlib>
 #include<queue>
 #include<vector>
 #include<map>
 #include<stack>
 #include<string>
 #define LL long long

 const int MAXN=;
 const int MAXM=;
 const int INF=;

 using namespace std;

 int T;
 char s[];

 int solve(){
     int len=strlen(s);
     int MIN=INF;
     int now=;
     int flag=;
     for (int i=;i<len;i++){
             if (s[i]=='a')
                 now++;
             else
                 now--;
             if (now==MIN) flag=;
             if (now<MIN){
                     MIN=now;
                     flag=;
             }
     }
     if (MIN>=) return now-;
     if (MIN==now) return +abs(now);
     return +now-MIN*-flag;
 }

 int main(){
     scanf("%d",&T);
     for (int cas=;cas<=T;cas++){
             scanf("%s",s);
             int ans=solve();
             if (s[]=='+' && s[]=='a' && s[]=='a'){
                     s[]='a';
                     s[]='a';
                     s[]='+';
                     ans=min(ans,solve()+);
             }
             printf("Case %d: %d\n",cas,ans);
     }
     return ;
 }
 /*
 4
 a
 a+a
 +aa
 aa++++a
 */