Pagini recente » Cod sursa (job #503515) | Cod sursa (job #3032839) | Cod sursa (job #1362393) | Cod sursa (job #359365) | Cod sursa (job #373746)
Cod sursa(job #373746)
#include<stdio.h>
int n,m,dif,c1[1001][1001],c2[1001][1001],b1[1001][1001];
int b2[1001][1001],a1[1001][1001],a,b,nr,mdif,d[1001],p;
void deque(int a,int b)
{
int in,k,i,j;
//min deq a
for(i=1;i<=n;i++)
{
in=1;
k=0;
for(j=1;j<=m;j++)
{
if(d[in]<j-a+1)
in++;
d[++k]=j;
while(a1[i][j]< a1[i][d[k-1]] && k>in)
{
k--;
d[k]=d[k+1];
}
b1[i][j]=a1[i][d[in]];
} //for
}//for
//min deq b
for(j=1;j<=m;j++)
{
in=1;
k=0;
for(i=1;i<=n;i++)
{
if(d[in]<i-b+1)
in++;
d[++k]=i;
while(b1[i][j]< b1[d[k-1]][j] && k>in)
{
k--;
d[k]=d[k+1];
}
c1[i][j]=b1[d[in]][j];
} //for
}//for
//max deq a////////////////////////////////
for(i=1;i<=n;i++)
{
in=1;
k=0;
for(j=1;j<=m;j++)
{
if(d[in]<j-a+1)
in++;
d[++k]=j;
while(a1[i][j] > a1[i][d[k-1]] && k>in)
{
k--;
d[k]=d[k+1];
}
b2[i][j]=a1[i][d[in]];
} //for
}//for
//max deq b
for(j=1;j<=m;j++)
{
in=1;
k=0;
for(i=1;i<=n;i++)
{
if(d[in]<i-b+1)
in++;
d[++k]=i;
while(b2[i][j]> b2[d[k-1]][j] && k>in)
{
k--;
d[k]=d[k+1];
}
c2[i][j]=b2[d[in]][j];
} //for
}//for
///////////////////////////////////////
for(i=b;i<=n;i++)
for(j=a;j<=m;j++)
{
dif=c2[i][j]-c1[i][j];
if(dif==mdif)
nr++;
if(dif<mdif)
{
mdif=dif;
nr=1;
}
}
} //deque
int main ()
{
int i,j;
freopen("struti.in","r",stdin);
freopen("struti.out","w",stdout);
scanf("%d%d%d",&n,&m,&p);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a1[i][j]);
for(i=1;i<=p;i++)
{
mdif=10000;
scanf("%d%d",&a,&b);
deque(a,b);
if(a!=b)
deque(b,a);
printf("%d %d\n", mdif,nr);
}
return 0;
}