思路:
根据每个结点的深度和数值就可算出整个天平的总质量(假设的平衡的情况)
算出后,记录结果出现次数最多的个数MAX,在让总节点个数减去MAX即可!
深度计算方法:
遇到[ 深度++,遇到] 深度--即可!
注意:
数组尽量开大点,RE了好几次!
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
char s[maxn];
typedef long long ll;
map<ll,ll>m;
int main()
{
int T;
scanf("%d",&T);
while(T--){
m.clear();
scanf("%s",s);
int len = strlen(s);
ll h = 0,sum_dig=0,MAX=-1;
for (int i = 0; i < len; ++i){
char ch = s[i];
if (ch == '[')++h;
else if (ch == ']')--h;
else if (isdigit(ch)){
++sum_dig;
ll key=0;
while(isdigit(s[i])){
key = key * 10 + s[i] - 48;
++i;
}--i;
ll val = key << h;
m[val]++;
MAX= max(MAX,m[val]);
}
}
printf("%lld\n",sum_dig-MAX);
}
return 0;
}