题解:
1、维护前缀和,然后存入map<long long , set>查询相等值的最大区间
2、虽然出题人说了序列可以不连续,但是我写的连续A了。。。
#include<bits/stdc++.h>
using namespace std;
#define LL long long
LL a[100005];
LL sum[100005];
map<LL,set<LL> >m;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
LL n,k;
cin >> n >> k;
for(LL i = 1;i <= n;i++){
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
sum[i] %= k;
m[sum[i]].insert(i);
}
m[0].insert(0);
LL ans = 0;
for(auto it = m.begin();it != m.end();it++){
if(it->second.size() > 1){
LL tmp = *(it->second.rbegin()) - *(it->second.begin());
ans = max(tmp,ans);
}
}
cout << ans << endl;
return 0;
}