【UOJ131】【BZOJ4199】【NOI2015】品酒大会（后缀数组）

Description

click me

Solution

先求出height数组XJB乱推式子算出第一问

至于第二问，用st表维护每个区间的最大值、最小值，每次用可计入贡献的区间中的两个最大值的积、两个最小值的积更新即可。

具体实现细节参看代码。

Source

/**********************************
 * Au: Hany01
 * Prob: UOJ131 & BZOJ4199 & NOI2015 品酒大会
 * Date: Feb 5th, 2018
 * Email: hany01@foxmail.com
**********************************/

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<set>

using namespace std;

typedef long long LL;
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define rep(i, k) for (register int i = 0, i##_end_ = (k); i < i##_end_; ++ i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    register int _ = 0, __ = 1; register char c_ = getchar();
    for ( ; c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("uoj131.in", "r", stdin);
    freopen("uoj131.out", "w", stdout);
#endif
}

const int maxn = 300005, maxlog = 20;

int c[maxn], rk[maxn << 1], tp[maxn << 1], sa[maxn], height[maxn], n, m, l[maxn], r[maxn], a[maxn], Max[maxn][maxlog], Min[maxn][maxlog], Log2[maxn];
LL Ans1[maxn], Ans2[maxn];
char s[maxn];

inline void Radix_Sort()
{
    For(i, 1, m) c[i] = 0;
    For(i, 1, n) ++ c[rk[i]];
    For(i, 1, m) c[i] += c[i - 1];
    Fordown(i, n, 1) sa[c[rk[tp[i]]] --] = tp[i];
}

inline void Build_SA()
{
    For(i, 1, n) rk[i] = s[i], tp[i] = i;
    m = 255, Radix_Sort();
    for (register int k = 1, p; k <= n; k <<= 1) {
        p = 0;
        For(i, n - k + 1, n) tp[++ p] = i;
        For(i, 1, n) if (sa[i] > k) tp[++ p] = sa[i] - k;
        Radix_Sort(), swap(rk, tp), rk[sa[1]] = 1, m = 1;
        For(i, 2, n) rk[sa[i]] = tp[sa[i]] == tp[sa[i - 1]] && tp[sa[i] + k] == tp[sa[i - 1] + k] ? m : ++ m;
        if (m == n) break;
    }
    for (register int i = 1, j, k = 0; i <= n; height[rk[i ++]] = k)
        for (j = sa[rk[i] - 1], k = k ? k - 1 : 0; s[i + k] == s[j + k]; ++ k) ;
}

inline void Init()
{
    n = read(), scanf("%s", s + 1), Build_SA();
    For(i, 2, n) Log2[i] = Log2[i >> 1] + 1;
    For(i, 1, n) a[i] = Min[rk[i]][0] = Max[rk[i]][0] = read();
    rep(j, Log2[n]) For(i, 1, n - (1 << (j + 1)) + 1)
        Min[i][j + 1] = min(Min[i][j], Min[i + (1 << j)][j]),
        Max[i][j + 1] = max(Max[i][j], Max[i + (1 << j)][j]);
}

inline void Solve1()
{
    For(i, 1, n) {
        for (l[i] = i - 1; l[i] && height[l[i]] > height[i]; l[i] = l[l[i]] - 1) ;
        ++ l[i];
    }
    Fordown(i, n, 1) {
        for (r[i] = i + 1; r[i] <= n && height[r[i]] >= height[i]; r[i] = r[r[i]] + 1) ;
        -- r[i];
    }
    For(i, 2, n) Ans1[height[i]] += (r[i] - i + 1) * 1ll * (i - l[i] + 1);
}

inline int Query_max(int l, int r) {
    register int tmp = Log2[r - l + 1];
    return max(Max[l][tmp], Max[r - (1 << tmp) + 1][tmp]);
}

inline int Query_min(int l, int r) {
    register int tmp = Log2[r - l + 1];
    return min(Min[l][tmp], Min[r - (1 << tmp) + 1][tmp]);
}

inline void Solve2()
{
    Set(Ans2, 128);
    For(i, 2, n)
        chkmax(Ans2[height[i]], Query_max(l[i] - 1, i - 1) * 1ll * Query_max(i, r[i])),
        chkmax(Ans2[height[i]], Query_min(l[i] - 1, i - 1) * 1ll * Query_min(i, r[i]));
}

inline void Print()
{
    LL ns = Ans2[maxn - 1];
    Fordown(i, n - 2, 0) {
        Ans1[i] += Ans1[i + 1];
        if (Ans2[i + 1] != ns) chkmax(Ans2[i], Ans2[i + 1]);
    }
    rep(i, n) printf("%lld %lld\n", Ans1[i], Ans2[i] == ns ? 0 : Ans2[i]);
}

int main()
{
    File();
    Init();
    Solve1();
    Solve2();
    Print();
    return 0;
}