题目:
题意:可以将两个相数字合并为一个数字,这个操作不限次数。
给定一个数字序列,和数p,求每段数字序列都是p的倍数的最长长度。
思路:贪心算法 前缀和 map(https://blog.csdn.net/sevenjoin/article/details/81943864)
先预处理前缀和,当有两个前缀和相等时,这段区间和就一定是p的倍数,当前缀和为p的倍数时,答案也加一
(m=n%p=(n+k*p)%p)
代码
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int a[N],sum[N];
int main(){
int t,n,p;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&p);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum[i]=(a[i]+sum[i-1])%p;
}
map<int,int>m;
int ans=0;
m[0]=1;
for(int i=1;i<=n;i++){
if(m[sum[i]]){
ans++;
m.clear();
}
m[sum[i]]=1;
}
printf("%d\n",ans);
}
return 0;
}
参考:https://blog.csdn.net/qq_43765333/article/details/107656744?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522159618201819195239801544%2522%252C%2522scm%2522%253A%252220140713.130102334…%2522%257D&request_id=159618201819195239801544&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2allfirst_rank_ecpm_v3~rank_business_v1-1-107656744.ecpm_v3_rank_business_v1&utm_term=Tokitsukaze+and+Multiple&spm=1018.2118.3001.4187