hdu 2766 Equilibrium Mobile-白红宇

hdu 2766 Equilibrium Mobile

阅读量：5285 次

发布时间：2019-06-14

本文共 1653 字，大约阅读时间需要 5 分钟。

　　不知道算是什么题，应该是排序题吧。。。。

　　直接将weight乘以2^depth，然后统计相同的个数最多有多少个，用总数减去统计出来的个数就是答案了！

　AC代码：

View Code

1 /* 2 Auther: Lyon 3 Problem: hdu 2766 4 */ 5  6 #include 
      
        7 #include 
       
         8 #include 
        
          9 #include 
         
          10 #include 
          
           11 #include 
           12 #include 
            
             13 #include 
             
              14 15 using namespace std;16 typedef __int64 ll;17 typedef vector
              
                vi;18 typedef vector
               
                 vll;19 20 string buf;21 vll weight;22 23 int deal(){24 weight.clear();25 cin >> buf;26 27 int depth = 0;28 ll tmp;29 30 for (string::iterator ii = buf.begin(); ii != buf.end(); ii++){31 switch (*ii){32 case '[':33 {34 depth++;35 }break;36 case ']':37 {38 depth--;39 }break;40 case ',':break;41 default:42 {43 tmp = 0;44 while ('0' <= *ii && *ii <= '9') tmp = tmp * 10 + *ii - '0', ii++;45 ii--;46 //printf("tmp %d\n", tmp);47 weight.push_back(tmp << depth);48 }49 }50 }51 52 sort(weight.begin(), weight.end());53 54 int len = weight.size();55 int best = 0, cur = 1;56 57 weight.push_back(-1);58 for (int i = 0; i < len; i++){59 if (weight[i + 1] != weight[i]){60 best = max(best, cur);61 cur = 1;62 }63 else cur++;64 }65 66 return len - best;67 }68 69 int main(){70 int T;71 72 //freopen("in", "r", stdin);73 scanf("%d", &T);74 while (T--){75 cout << deal() << endl;76 }77 78 return 0;79 }