习题6-6(uva-12166)

以某个重量为基准使得天平平衡
1.至少与一个叶子节点相关联(当前叶子节点在本深度下是不需要改变重量的)
2.知道基准了，那么总重量就知道了(总重量 = 基准 * $2^{基准深度}$)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int NMAX = 1e7 + 7;
map<long long int, int> tot;
char in[NMAX];
int  sum = 0, cnt = 0, len = 0;

void dfs(int depth, int nStart, int nEnd) {
	if (in[nStart] == '[') {
		int d = 0;
		for (int i = nStart + 1; i < nEnd; ++i) {
			if (in[i] == '[')++d;
			else if (in[i] == ']') --d;
			else if(d == 0 && in[i] == ','){
				dfs(depth + 1, nStart + 1, i - 1);
				dfs(depth + 1, i + 1, nEnd-1);
				return;
			}
		}
	}
	else {
		long long int val = 0;
		for (int i = nStart; i <= nEnd; ++i) {
			val = val * 10 + (in[i] - '0');
		}
		sum++;
		cnt = max(cnt,++tot[val << depth]);
	}
}
int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> in;
		tot.clear();
		sum = 0,cnt = 0,len = strlen(in);
		dfs(0, 0, len - 1);
		cout << sum - cnt << endl;
	}
	return 0;
}

更简洁的方法

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int NMAX = 1e6 + 7;
map<long long int, int> tot;
char in[NMAX];

int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> in;
		tot.clear();
		int depth = 0, sum = 0, cnt = 0, len = strlen(in);

		for (int i = 0; i < len; ++i) {
			if (in[i] == '[') ++depth;
			else if (in[i] == ']') --depth;
			else if (isdigit(in[i])) {
				long long int val = in[i++] - '0';
				while (isdigit(in[i])) val = val * 10 + (in[i++] - '0');

				cnt = max(cnt, ++tot[val << depth]);

				sum++;

				if (i < len && in[i] == ']')--depth;
			}
		}
		cout << sum - cnt << endl;
	}
	return 0;
}