Cod sursa(job #196031)

Utilizator nusmaibunkeleviprofesor cicalescu nusmaibunkelevi Data 24 iunie 2008 06:23:52
Problema Divk Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.02 kb
#include<stdio.h>
#define NMAX 500001

struct el{int r,p;};
int n;
el v[NMAX];

void poz(int st,int dr,int &piv){
int i=st,j=dr,d=0;
el t;
while(i<j){
	if(v[i].r>v[j].r||v[i].r==v[j].r&&v[i].p>v[j].p)
		{t=v[i];v[i]=v[j];v[j]=t;d=1-d;}
	i+=d;j-=1-d;
	}
piv=i;
}

void qsrt(int li,int ls){
int piv;
if(li<ls){
	poz(li,ls,piv);
	qsrt(li,piv-1);
	qsrt(piv+1,ls);
	}
}

int main(){
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
int i,j,nrs=0,k,a,b,x,d;
scanf("%d%d%d%d",&n,&k,&a,&b);
for(i=1;i<=n;++i){
	v[i].p=i;
	scanf("%d",&x);
	v[i].r=v[i-1].r+x;
	if(v[i].r>=k) v[i].r=v[i].r%k;
	}
qsrt(1,n);
i=0;
while(i<n){
   //	k=0;
	j=i+1;
	while(v[j].r==v[i].r){
		d=v[j].p-v[i].p;
		if(d>b) break;
		if(d>=a) nrs++;
		++j;
		}
   //	if(k) i++;
   //	else i=j;
	i++;
	}

/*
for(i=1;i<n;++i)
	for(j=i+1;j<=n;++j){
		if(v[j].r!=v[i].r)
		d=v[j].p-v[i].p;
		if(v[j].p-v[i].p
		}


for(j=a;j<=b;++j)
	for(i=j;i<=n;++i)
		if(v[i]==v[i-j]) nrs++;*/
printf("%d",nrs);
return 0;
}