Yura and Developers
题目大意
给出一个长度为n的区间,求其中有多少个区间,使得这个区间中所有元素的和减去这个区间中的最大值除以k的余数为0.
代码
#include<cstdio>
#include<cstring>
#include<algorithm>
#define int long long
using namespace std;
const int maxn = 3 * 1e5 + 10;
const int maxm = 1e6 + 10;
const int INF = 1e9 + 7;
int a[maxn], pre[maxn], lsum[maxm], rsum[maxm], lpoi, rpoi, k, mx, ans, n;
void devide(int l, int r){
int mid = (l + r) / 2;
if(l == r)
return;
devide(l, mid);
devide(mid + 1, r);
lpoi = mid;
rpoi = mid + 1;
mx = 0;
while(lpoi >= l){//固定最大值在左边
while(a[rpoi] <= a[lpoi] && rpoi <= r){
rsum[(k + (pre[rpoi] - pre[mid]) % k) % k] ++;
rpoi ++;
}
while((a[lpoi] < a[rpoi] || rpoi > r) && lpoi >= l){
mx = max(a[lpoi], mx);
ans += rsum[(k - (pre[mid] - pre[lpoi - 1] - mx) % k) % k];
lpoi --;
}
}
for(int i = mid + 1; i <= r; i ++){
rsum[(k + (pre[i] - pre[mid]) % k) % k] = 0;
}
lpoi = mid;
rpoi = mid + 1;
mx = 0;
while(rpoi <= r){//固定最大值在右边
while(a[lpoi] < a[rpoi] && lpoi >= l){
lsum[(k + (pre[mid] - pre[lpoi - 1]) % k) % k] ++;
lpoi --;
}
while((a[rpoi] <= a[lpoi] || lpoi < l) && rpoi <= r){
mx = max(a[rpoi], mx);
ans += lsum[(k - (pre[rpoi] - pre[mid] - mx) % k) % k];
rpoi ++;
}
}
for(int i = l; i <= mid; i ++)
lsum[(k + (pre[mid] - pre[i - 1]) % k) % k] = 0;
main(){
while(scanf("%I64d %I64d", &n, &k) == 2 && n){
pre[0] = 0;
for(int i = 1; i <= n; i ++){
scanf("%I64d", &a[i]);
pre[i] = (pre[i - 1] + a[i]) % k;//pre数组为前缀和
}
ans = 0;
devide(1, n);//分治
printf("%I64d\n", ans);
}
return 0;
}