小圆前辈的数组--前缀和

题意：
求给定数组有多少个连续子序列满足，区间和%k=0且>z
思路:
求区间 [ l , r ] 的和sum%k=0转化为求其前缀和(per[ r ] - per [ l - 1 ])%k=0;
再判断下(per[ r ] - per [ l - 1 ])是否大于z即可。

#include<bits/stdc++.h>
using namespace std;
template <typename T> void debug(string s,T x) { cout <<s<< "=" << x << "\n"; }
typedef long long ll;
typedef unsigned long long ull;
const ll N = 1e6 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 0x7fffffff;
ll suffix[N];
ll trans[N];
vector<ll> pos[N];
int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    ll n, k, z;
    cin >> n >> k >> z;
    for (ll i = 1; i <= n; i++) {
        ll t;
        cin >> t;
        suffix[i] = t + suffix[i - 1];
        trans[i] = suffix[i] % k;
        pos[trans[i]].push_back(i);
    }
    ll ans = 0;
    for (ll i = 1; i <= n; i++) {
        ll idx = trans[i - 1];
        for (ll j = 0; j < pos[idx].size(); j++) {
            if (suffix[pos[idx][j]] - suffix[i - 1] >= z)ans++;
        }
    }
    cout << ans;
    
    return 0;

}