Pagini recente » Cod sursa (job #155100) | Cod sursa (job #628891) | Cod sursa (job #2402130) | Cod sursa (job #230146) | Cod sursa (job #261869)
Cod sursa(job #261869)
#include <stdio.h>
#include <stdlib.h>
#define MAXN 1024
struct toxicpie
{
int v,p;
};
int v[MAXN][MAXN];
int T1[MAXN][MAXN];
int T2[MAXN][MAXN];
toxicpie D1[MAXN];
toxicpie D2[MAXN];
int M,N,P,m=0,r=0;
void chestie2(int X, int Y)
{
int i,j,L1=0,L2=0,R1=0,R2=0,tt=0;
m=8001; r=0;
for (j=1; j<=M; ++j)
{
L1=L2=1; R1=R2=0;
for (i=1; i<X; ++i)
{
while (L1<=R1 && v[i][j] >= D1[R1].v) --R1;
D1[++R1].p = i; D1[R1].v=v[i][j];
while (L2<=R2 && v[i][j] <= D2[R2].v) --R2;
D2[++R2].p = i; D2[R2].v=v[i][j];
}
for (i=X; i<=N; ++i)
{
while (L1<=R1 && v[i][j] >=D1[R1].v) --R1;
D1[++R1].p = i; D1[R1].v=v[i][j];
while (L2<=R2 && v[i][j] <= D2[R2].v) --R2;
D2[++R2].p = i; D2[R2].v=v[i][j];
if (D1[L1].p==i-X) ++L1;
T1[i][j]=D1[L1].v;
if (D2[L2].p==i-X) ++L2;
T2[i][j]=D2[L2].v;
}
}
for (i=X; i<=N; ++i)
{
L1=L2=1; R1=R2=0;
for (j=1; j<Y; ++j)
{
while (L1 <= R1 && T1[i][j] >= D1[R1].v ) --R1;
D1[++R1].p = j; D1[R1].v = T1[i][j];
while (L2 <= R2 && T2[i][j] <= D2[R2].v ) --R2;
D2[++R2].p = j; D2[R2].v = T2[i][j];
}
for (j=Y; j<=M; ++j)
{
while (L1 <= R1 && T1[i][j] >= D1[R1].v ) --R1;
D1[++R1].p = j; D1[R1].v = T1[i][j];
while (L2 <= R2 && T2[i][j] <= D2[R2].v ) --R2;
D2[++R2].p = j; D2[R2].v = T2[i][j];
if (D1[L1].p==j-Y) ++L1;
if (D2[L2].p==j-Y) ++L2;
T1[i][j]=D1[L1].v;
T2[i][j]=D2[L2].v;
tt=D1[L1].v - D2[L2].v;
if (tt==m) r++;
if (tt<m) {m=tt; r=1;}
}
}
}
void citire()
{
int i,j,m2,r2,X,Y;
scanf("%d%d%d",&N,&M,&P);
if (M>N)
{
for (i=1; i<=N; ++i)
for (j=1; j<=M; ++j)
scanf("%d",&v[i][j]);
}
else
{
for (i=1; i<=N; ++i)
for (j=1; j<=M; ++j)
scanf("%d",&v[j][i]);
M=M+N; N=M-N; M=M-N;
}
for (i=0; i<P; ++i)
{
scanf("%d%d",&X,&Y);
chestie2(X,Y); m2=m; r2=r;
if (X!=Y)
{
chestie2(Y,X);
if (m2==m) r2+=r;
if (m2>m) { m2=m; r2=r;}
}
printf("%d %d\n",m2,r2);
}
}
int main()
{
freopen("struti.in","r",stdin);
freopen("struti.out","w",stdout);
citire();
fclose(stdin);
fclose(stdout);
return 0;
}