Pagini recente » Cod sursa (job #1614758) | Cod sursa (job #1438214) | Cod sursa (job #2673228) | Cod sursa (job #1912915) | Cod sursa (job #949103)
Cod sursa(job #949103)
#include<stdio.h>
int v[1002][1002];
int main()
{
freopen("gradina3.in","r",stdin);
freopen("gradina3.out","w",stdout);
int n,p,k,i,j,x,y,max,sol=0,nr=1,sum;
scanf("%d%d%d",&n,&p,&k);
for(i=1;i<=p;i++)
{
scanf("%d%d",&x,&y);
v[x][y]=1;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
v[i][j]+=v[i-1][j]+v[i][j-1]-v[i-1][j-1];
max=n-k+1;
for(i=1;i<=max;i++)
for(j=1;j<=max;j++)
{
sum=v[i+k-1][j+k-1]-v[i+k-1][j-1]-v[i-1][j+k-1]+v[i-1][j-1];
if(sum>sol)
{
sol=sum;
nr=1;
}
else
if(sum==sol)
nr++;
}
printf("%d\n%d\n",sol,nr);
return 0;
}