题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=4511
题意:给你n个数,求一个最长的区间,使得区间和能被7整除
思路:求出前缀和mod7,然后遍历,查看,如果拥有相同的余数,说明这个区间是可以被7整除的,那么记录
ac代码:
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
using namespace std;
LL gcd(LL a,LL b){return b?gcd(b,a%b):a;}
LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
LL powmod(LL a,LL b,LL MOD){LL ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
double dpow(double a,LL b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
//head
LL a[MAXN],sum[MAXN];
LL pri[10],v[10];
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF)
{
sum[0]=0;
for(i=1;i<=n;i++)
scanf("%lld",&a[i]),sum[i]=(sum[i-1]+a[i])%7;
mem(v);
for(i=1;i<=n;i++)
{
if(!v[sum[i]])
v[sum[i]]=i,pri[sum[i]]=i;
else
{
pri[sum[i]]=i;
}
}
LL ans=-1;
for(i=0;i<7;i++)
{
if(!v[i])
continue;
ans=max(ans,pri[i]-v[i]);
}
printf("%lld\n",ans);
}
return 0;
}