UVALive6832 - Bit String Reordering

 水题

总结

不应该改变s数组，而是cur数组里面的数

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 20;
const int INF = 0x3f3f3f3f;
int n, m, t;
int s[maxn], cur0[maxn], cur1[maxn];
int main()
{
  //  freopen("in.txt","r",stdin);
    while(cin >> n >> m){
        memset(s, 0, sizeof s);
        int num_0 = 0, num_1 = 0;
        for(int i = 0; i < n; i++)
            cin >> s[i];
        int k = 0;
        bool flag = false;
        for(int i = 0; i < m; i++){
            cin >> t;
            while(t--){
                if(flag){
                    cur0[k] = 1;
                    cur1[k++] = 0;
                }
                else{
                    cur0[k] = 0;
                    cur1[k++] = 1;
                }
            }
            flag = !flag;
        }
        int cnt_0 = 0, cnt_1 = 0;
        for(int i = 0; i < n; i++){
            if(s[i] != cur0[i])
                for(int j = i+1; j < n; j++)
                    if(s[i] == cur0[j]){
                        swap(cur0[j], cur0[i]);
                        cnt_0 += j-i;
                        break;
                    }
            if(s[i] != cur0[i]) {
                cnt_0 = INF;
                break;
            }
        }
        for(int i = 0; i < n; i++){
            if(s[i] != cur1[i])
                for(int j = i+1; j < n; j++)
                    if(s[i] == cur1[j]){
                        swap(cur1[j], cur1[i]);
                        cnt_1 += j-i;
                        break;
                    }
            if(s[i] != cur1[i]) {
                cnt_1 = INF;
                break;
            }
        }
        cout << min(cnt_0, cnt_1) << endl;
    }
    return 0;
}