[UOJ21]缩进优化

Description

输入$a_1,a_2,a_3,...,a_n$,找出值$x$,使

$$\sum_{i=1}^n\biggl\lfloor\frac{a_i}{x}\biggr\rfloor+a_i\mod x$$

Solution

反向考虑使缩减的字符数最多，那么对于长度为$x$的tab，缩减的字符数为$x-1$，所以考虑如何快速计算长度为$x$的tab缩减的代码量。

对于每个长度$tx \le a_i < (t+1)x$的行，贡献为 t <script type="math/tex" id="MathJax-Element-8">t</script>，所以可以统计一个后缀和计算即可。

#include <cstdio>
#include <cstdlib>
using namespace std;

typedef long long ll;
const int maxn = 1000005;
int n, a[maxn], s[maxn];

inline int gi()
{
    char c = getchar();
    while(c < '0' || c > '9') c = getchar();
    int sum = 0;
    while('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
    return sum;
}

int main()
{
    freopen("tab.in", "r", stdin);
    freopen("tab.out", "w", stdout);

    ll sum = 0, res, ans = 0;
    int Maxa = 0, i, a, j;
    n = gi();
    for(i = 1; i <= n; ++i) {
        a = gi(); sum += a; ++s[a];
        if(Maxa < a) Maxa = a;
    }
    for(int i = Maxa - 1; i >= 1; --i) s[i] += s[i + 1];

    for(i = 1; i <= Maxa; ++i) {
        res = 0;
        for(j = i; j <= Maxa; j += i) res += s[j];
        res *= (i - 1);
        if(res > ans) ans = res;
    }

    printf("%lld\n", sum - ans);

    return 0;
}