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

题目链接：https://nanti.jisuanke.com/t/15768

题意：中文题诶～

思路：直接hash就好了，当时zz了没想到．．．

代码：

 #include <iostream>
 #include <stdio.h>
 #define ll long long
 using namespace std;

 const int MAXN = 1e5;
 ll a[MAXN] = {};
 ll w[MAXN];

 int main(void){
     ll n, m, k, x;
     scanf("%lld", &n);
     for(int i = ; i <= n; i ++){
         w[i] = w[i-] *  + ;
     }
     for(int i = ; i <= n; i ++){
         cin >> x;
         a[i] = a[i-] + w[x];
     }
     scanf("%lld", &m);
     while(m--){
         ll ans = , cnt = ;
         cin >> k;
         for(int i = ; i < k; i++){
             cin >> x;
             cnt += w[x];
         }
         for(int i=k; i<=n; i++){
             if(a[i] - a[i-k] == cnt) ans ++;
         }
         printf("%lld\n", ans);
     }
     return ;
 }