E - Easy Arithmetic

题目大意

给定一个只包含‘+’，‘-’ 和数字的数学表达式，可以任意添加‘+’或‘-’使该式值最大

思路

要保证值最大，只需添加’+‘，遇到减一个大于等于10的数，只需从第二位开始添加’+‘即可

如-23333 可变为 -2 + 3333，这里需要特判的是如-20033之类的，因为不能含前导0，所以需要将0分离，变为 -2 + 0 + 0 + 33，模拟即可

//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast", "inline", "-ffast-math")
//#pragma GCC target("abm,avx,mmx,popcnt,sse,sse2,sse3,ssse3,sse4")
#include <algorithm>
#include <cstring>
#include <iostream>
#define dbg(x) cout << #x << '=' << x << endl
#define dbg1(x, y) cout << #x << '=' << x << ',' << #y << '=' << y << endl
#define FA ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
using namespace std;
const int N = 2e5 + 10, M = 2 * N, mod = 1e9 + 7;
const double eps = 1e-8;
typedef long long LL;
typedef pair<int, int> PII;
int n, m;

void solve() {
    string s;
    cin >> s;
    for (int i = 0; i < s.size(); i++) {
        cout << s[i];
        if (s[i] == '-') {
            if (i + 2 > s.size() - 1 || !isdigit(s[i + 2])) continue;
            i++;
            cout << s[i];
            i++;
            while (s[i] == '0') {
                cout << '+' << 0;
                i++;
            }
            if (isdigit(s[i])) cout << '+';
            while (isdigit(s[i])) cout << s[i++];
            i--;
        }
    }
}
signed main() {
    freopen("easy.in", "r", stdin);
    freopen("easy.out", "w", stdout);
    int T = 1;  // cin>>T;
    while (T--) solve();
}