Dividing Strings

最新推荐文章于 2023-07-20 01:16:17 发布

_sky123_

最新推荐文章于 2023-07-20 01:16:17 发布

阅读量205

点赞数

分类专栏： # 思维

本文链接：https://blog.csdn.net/qq_45323960/article/details/107739581

版权

思维专栏收录该内容

64 篇文章 1 订阅

订阅专栏

链接：https://ac.nowcoder.com/acm/contest/5669/D
来源：牛客网

With powerful decision-making skills, ZYB can solve complex problems

ZYB has a decimal string ${s}$ of length ${n}$ . He wants to split the string into several (at least $2$ ) non-empty continuous substrings and minimize the difference between the maximum value and the minimum value of the gifts. The value of a continuous substring is the value of it when it’s considered as a decimal number.
For instance, when the string ‘1230’ is split into ‘12’ and ‘30’, the values of the two parts are 12 and 30 separately. Notice that the substrings are not allowed to contain leading zero(s). For example, the only feasible way of splitting ‘001’ is ‘0’, ‘0’ and ‘1’.

Can you help ZYB find the fairest splitting?
输入描述:
There are multiple test cases. The first line of input contains an integer ${T}$ , indicating the number of test cases. For each test case:
The first line contains an integer ${n}$ ( $\le n \le 10^5$ ), indicating the length of the decimal string.
The second line contains a decimal string ${s}$ of length ${n}$ .( $\text{'0'} \le s[i] \le \text{'9'}$ for each $\le i \le n$ ).
It is guaranteed that the sum of ${n}$ in all test cases does not exceed $10^6$ .
输出描述:
For each test case, output one line containing the minimum difference between the maximum value and the minimum value.
示例1

分两种情况讨论。
第一种情况是所有划分的子串长度相等，从小到大枚举循环节的长度 $i$ ，如果 $n\mod i=0$ ，则在所有循环节中找出最大的和最小的，然后最大减最小更新 $a n s$ ，需要用到大数相减和大数比较。时间复杂度为 $O(n\sqrt n)$ 。因为不能有前导 $0$ ，实际跑不满这个复杂度。
第二种情况是划分的子串不相等。因为最后一定 $a n s \leq 9$ ，因此子串的长度相差 $1$ ，且较长的子串为 $100\dots0x$ ；较短的子串为 $99\dots9y$ ，枚举子串长度判断是否子串可以划分为这两种形式，若能够划分，则用 $10 + x - y$ 来更新 $a n s$ 。观察可发现全 $0$ 子串和全 $1$ 子串求和比较特殊，因此可以用前缀和来实现 $O (1)$ 判断，复杂度为 $O(nH_n)$ ,实际子串很难全部划分为仅这两种类型，因此复杂度接近 $O (n)$ 。
最终时间复杂度为 $O(n\sqrt n)$ 。

#include <bits/stdc++.h>

#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scanf("%c",&a)
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) for(register int i=a;i<=b;++i)
#define repd(i, a, b) for(register int i=a;i>=b;--i)
#define reps(s) for(register int i=head[s];i;i=Next[i])
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define pii pair<int,int>
#define mii unordered_map<int,int>
#define msi unordered_map<string,int>
#define lowbit(x) ((x)&(-(x)))
#define ce(i, r) i==r?'\n':' '
#define pb push_back
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define pr(x) cout<<#x<<": "<<x<<endl
using namespace std;

inline int qr() {
    int f = 0, fu = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-')fu = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        f = (f << 3) + (f << 1) + c - 48;
        c = getchar();
    }
    return f * fu;
}

const int N = 1e5 + 10;
char str[N];
int a[N], s[N], b[N], T, n, ans;

inline bool cmp(int x, int y, int l) {
    repi(i, 0, l - 1)if (a[x + i] != a[y + i])return a[x + i] < a[y + i];
    return false;
}

inline void sub(int x, int l) {
    repi(i, 1, l)b[i] -= a[x + i - 1];
    repd(i, n, 1)if (b[i] < 0)b[i - 1]--, b[i] += 10;
}

inline int solve1(int l) {
    int mni = 1, mxi = 1;
    for (int i = 1; i <= n; i += l) {
        if (l > 1 && !a[i])return 9;
        if (cmp(i, mni, l))mni = i;
        else if (cmp(mxi, i, l))mxi = i;
    }
    memcpy(b + 1, a + mxi, sizeof(int) * (l + 10));
    sub(mni, l);
    repi(i, 1, l - 1)if (b[i])return 9;
    return b[l];
}

inline int solve2(int l) {
    int pos = 1, val1 = 9, val2 = 0;
    while (pos <= n) {
        if (a[pos] == 1) {
            if (pos + l > n || s[pos + l - 1] - s[pos])return 9;
            val2 = max(val2, a[pos + l]), pos += l + 1;
        } else {
            if (pos + l - 1 > n || s[pos + l - 2] - s[pos - 1] != 9 * (l - 1))
                return 9;
            val1 = min(val1, a[pos + l - 1]), pos += l;
        }
    }
    return 10 - val1 + val2;
}

int main() {
    T = qr();
    while (T--) {
        n = qr();
        ss(str + 1);
        ans = 9;
        repi(i, 1, n)a[i] = str[i] - '0', s[i] = s[i - 1] + a[i];
        repi(i, 1, n / 2) {
            ans = min(ans, solve2(i));
            if (n % i == 0)ans = min(ans, solve1(i));
        }
        pi(ans);
    }
    return 0;
}