hdu 4648 Magic Pen

Magic Pen 6

                                                                            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)

Problem Description

In HIT, many people have a magic pen. Lilu0355 has a magic pen, darkgt has a magic pen, discover has a magic pen. Recently, Timer also got a magic pen from seniors.At the end of this term, teacher gives Timer a job to deliver the list of N students who fail the course to dean's office. Most of these students are Timer's friends, and Timer doesn't want to see them fail the course. So, Timer decides to use his magic pen to scratch out consecutive names as much as possible. However, teacher has already calculated the sum of all students' scores module M. Then in order not to let the teacher find anything strange, Timer should keep the sum of the rest of students' scores module M the same.Plans can never keep pace with changes, Timer is too busy to do this job. Therefore, he turns to you. He needs you to program to "save" these students as much as possible.

 

Input

There are multiple test cases.The first line of each case contains two integer N and M, (0< N <= 100000, 0 < M < 10000),then followed by a line consists of N integers a1,a2,...an (-100000000 <= a1,a2,...an <= 100000000) denoting the score of each student.(Strange score? Yes, in great HIT, everything is possible)

 

Output

For each test case, output the largest number of students you can scratch out.

 

Sample Input

2 31 63 32 3 62 51 3

 

Sample Output

120
Hint
The magic pen can be used only once to scratch out consecutive students.

 

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define N 100005int a[N];long long sum[N];int main(){    int n,m,i,j,mod,max;    while(~scanf("%d%d",&n,&m))    {        for(i=0;i<=N;i++)            sum[i]=0;        for(i=1;i<=n;i++)        {            scanf("%d",&a[i]);            sum[i]=a[i]%m+sum[i-1];        }int flag=0;max=0;        for(i=n;i>=0;i--){for(j=n;j>=i;j--){if((sum[j]-sum[j-i])%m==0){flag=1;max=i;break;}}if(flag)break;}        printf("%d\n",max);    }    return 0;}

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define N 100005int a[N];struct node{    long long sum;    int id;}s[N];bool comp(node s1,node s2){    if(s1.sum==s2.sum)        return s1.id<s2.id;    else        return s1.sum<s2.sum;}int main(){    int i,n,m,p;    while(~scanf("%d%d",&n,&m))    {        for(i=0;i<=N;i++)            s[i].sum=0;        s[0].id=0;        for(i=1;i<=n;i++)        {            scanf("%d",&a[i]);            s[i].sum=(a[i]+s[i-1].sum)%m;            while(s[i].sum<0)                s[i].sum+=m;            s[i].id=i;        }        sort(s,s+n+1,comp);        int max=0;        for(i=1,p=0;i<=n;i++)        {            if(s[i].sum==s[p].sum)            {                if(s[i].id-s[p].id>max)                    max=s[i].id-s[p].id;            }            else                p=i;        }        printf("%d\n",max);    }    return 0;}