poj 1635 树的最小表示法

当模版了

点击打开链接 这个讲的不明不了 

看的这个点击打开链接

AC代码如下：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;

string x, a, b;

string calc_min_tree( int pos ){
    vector<string> v;
    int n = x.size();
    while( pos < n && x[pos] != '1' ){
        v.push_back( "0" + calc_min_tree( pos + 1 ) );
        pos += v.back().size();
    }
    string r = "";
    sort( v.begin(), v.end() );
    for( int i = 0; i < v.size(); i++ ){
        r += v[i];
    }
    return r + '1';
}

int main(){
    int T;
    cin >> T;
    while( T-- ){
        cin >> x;
        a = calc_min_tree( 0 );
        cin >> x;
        b = calc_min_tree( 0 );
        if( a == b ){
            cout << "same" << endl;
        }else{
            cout << "different" << endl;
        }
    }
    return 0;
}