EOJ Monthly 2020.9 C. 最小表示（贪心）

传送门

---

题目大意

给出一个$n$位的二进制数$b$，找出一个长度为$m$的序列$c$，每一位为$c_i(0,1,-1)$，使得：

${\sum }_{i=0}^n{b}_i\ast 2^i={\sum }_{i=0}^m{c}_i\ast 2^i$

输出序列$c$使得其中$1,-1$的总个数最少

解题思路

考虑一串连续的$111111$，对应在序列$c$中，如果$1,-1$最少，可以看做我们在最右边的一位加$1$，这样在$c$中对应的为$-1$，这样一连串连续进位，最后得到的$c$序列为$100000-1$，长度为$n+1$，但是这样的$1,-1$显然是最少的

但是考虑两串连续且中间夹了一个$0$的情况：$111011$，显然我们可以通过将这个$0$处补$1$并在最右边加$1$，使得成为：$1000-10-1$，这样是最少的。考虑中间为$2$个$0$以上的情况，同理不难发现此时无需经过相同操作，而是分开操作即可，均是最优

代码是遍历序列考虑所有的$0$两边分别有多少个$1$，然后分情况对$b,c$作出改变，大模拟…

//
// Created by Happig on 2020/9/28
//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 1e6 + 10;

string s, str;
int b[maxn], a[maxn];

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> str;
    int n = str.size();
    s = "";
    for (int i = n - 1; i >= 0; i--) {
        s += str[i];
    }
    for (int i = 0; i < n; i++) {
        b[i] = (s[i] == '1') ? 1 : 0;
    }
    for (int i = 0; i <= n; i++) {
        if (!b[i]) {
            int l = i - 1, r = i + 1;
            while (l >= 0 && b[l]) l--;
            while (r <= n && b[r]) r++;
            l++, r--;
            int cnt1 = i - l, cnt2 = r - i;
            if (cnt1 >= 2 && cnt2 >= 2) {
                a[i] = a[l] = -1;
                //cout << i << " " << l << ENDL;
                a[r + 1] = b[r + 1] = 1;
                for (int j = l; j <= r; j++) {
                    b[j] = 0;
                    if (j >= l + 1 && j < i) a[j] = 0;
                    if (j >= i + 1) a[j] = 0;
                }
                i = r + 1;
            } else if (cnt1 >= 2) {
                a[l] = -1;
                a[i] = b[i] = 1;
                for (int j = l; j < i; j++) {
                    b[j] = 0;
                    if (j >= l + 1) a[j] = 0;
                }
            } else if (cnt2 >= 2) {
                a[i + 1] = -1;
                a[r + 1] = b[r + 1] = 1;
                for (int j = i + 1; j <= r; j++) {
                    b[j] = 0;
                    if (j > i + 1) a[j] = 0;
                }
                i = r;
            } else a[i] = b[i];
        } else a[i] = b[i];
    }
    int s;
    for (int i = n; i >= 0; i--)
        if (a[i]) {
            s = i;
            break;
        }
    cout << s + 1 << ENDL;
    for (int i = s; i >= 0; i--) {
        cout << a[i] << " ";
    }
    cout << ENDL;
    return 0;
}