计蒜课/UCloud 的安全秘钥(hash)

                 1 #include <iostream>
 2 #include <stdio.h>
 3#define ll long long
 4usingnamespace std;
 5 6constint MAXN = 1e5;
 7 ll a[MAXN] = {1};
 8ll w[MAXN];
 910int main(void){
11    ll n, m, k, x;
12     scanf("%lld", &n);
13for(int i = 1; i <= n; i ++){
14         w[i] = w[i-1] * 233 + 17;
15    }
16for(int i = 1; i <= n; i ++){
17         cin >> x;
18         a[i] = a[i-1] + w[x];
19    }
20     scanf("%lld", &m);
21while(m--){
22         ll ans = 0, cnt = 0;
23         cin >> k;
24for(int i = 0; i < k; i++){
25             cin >> x;
26             cnt += w[x];
27        }
28for(int i=k; i<=n; i++){
29if(a[i] - a[i-k] == cnt) ans ++;
30        }
31         printf("%lld\n", ans);
32    }
33return0;
34 }