1009.Singing Superstar (子串数量统计) (2021“MINIEYE杯”中国大学生算法设计超级联赛8)

传送门

 题意：需要寻找母串s中总共有多少个不相交的子串ai。

思路：由于|s|达到1e5，且子串数量n也有1e5的大小，显然不能暴力寻找。再结合子串|ai|最多30的长度，我们可以遍历到s的每个位置时都截取1~30长度的子串，这样复杂度最多O(n*30)再加上一些函数和map的耗时2s也足够了，再利用二维数组统计每个子串的数量。最后需要注意的是，会有重复的ai，于是再利用二维数组统计时需避免重复。

 代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9+7;
const int  N = 2e5 + 5;

inline void read(int &x){
    char t=getchar();
    while(!isdigit(t)) t=getchar();
    for(x=t^48,t=getchar();isdigit(t);t=getchar()) x=x*10+(t^48);
}

int T = 1;

string s;
int n;
vector<int> v[N];
map<string, int> mp;
vector<string> res;

signed main()
{
    IOS;

    cin >> T;


    while(T --){
        cin >> s >> n;
        int minn = inf, maxx = 0, cnt = 0;
        for(int i = 1; i <= n; i ++){
            string ss; cin >> ss;
            res.push_back(ss);
            if(!mp[ss]) mp[ss] = ++cnt; //避免重复
            int sz = ss.size();
            minn = min(minn, sz); //从最小串到最大串大小遍历可再优化一小部分
            maxx = max(maxx, sz);
        }
        int len = s.size();
        for(int i = 0; i < len; i ++){
            for(int j = minn; j<=maxx&&i+j<=len; j ++){
                string st = s.substr(i, j);
                if(mp[st]){
//                    cout << "i: " << i << " st: " << st << endl;
                    int id = mp[st];
                    if(v[id].size()){ //判断当前子串是否会与上一统计子串有重叠
                        int rx = v[id].size();
                        int last = v[id][rx-1];
                        if(i-last>=j) v[id].push_back(i);
//                        cout << "last: " << last << " now: " << i << endl;
                    }
                    else v[id].push_back(i);
                }
            }
        }
        for(int i = 0; i < n; i ++){
            int id = mp[res[i]];
//            cout << "id: " << id << endl;
            cout << v[id].size() << endl;
        }
        for(int i = 1; i <= n; i ++) v[i].clear();  //初始化更新
        mp.clear(); res.clear();
    }

    return 0;
}