Cod sursa(job #63601)

Utilizator Binary_FireFlorin Pogocsan Binary_Fire Data 29 mai 2007 19:13:35
Problema Struti Scor 80
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.9 kb
#include <stdio.h>
#define fin  "struti.in"
#define fout "struti.out"
#define Nmax 1001
#define INFI 8001

//#define int short

int N,M,X,Y,P,best,cnt,map[Nmax][Nmax];
int dq1[Nmax][Nmax][2],dql1[Nmax][2],p1[Nmax][2];	//min	0 - prim 1 - varf
int dq2[Nmax][Nmax][2],dql2[Nmax][2],p2[Nmax][2];	//max
int pr1,vf1,pr2,vf2;

#define el(deq,pr,f,A,p) {	if ( deq[pr][1] <= p - A ) ++pr;  } 

#define ins1(deq,pr,vf,val,poz) {	while ( val < deq[vf][0] && vf >= pr )  	--vf;	++vf;	deq[vf][0]=val; deq[vf][1]=poz;}

#define ins2(deq,pr,vf,val,poz) {	while ( val > deq[vf][0] && vf >= pr ) 		--vf;	++vf;	deq[vf][0]=val; deq[vf][1]=poz;}

#define init1(pr,vf,val,poz) {	pr=1; vf=1;	val=INFI; poz=0;}

#define init2(pr,vf,val,poz) {	pr=1; vf=1;	val=-1; poz=0;}

void go(int X,int Y) {
int i,j,min,max,dif;

	init1(pr1,vf1,dql1[1][0],dql1[1][1]);	
	init2(pr2,vf2,dql2[1][0],dql2[1][1]);

	for (i=1;i<=M;++i) {
		init1(p1[i][0],p1[i][1],dq1[i][1][0],dq1[i][1][1]);
		init2(p2[i][0],p2[i][1],dq2[i][1][0],dq2[i][1][1]);
	}

	for (i=1;i<=N;++i)
	for (j=1;j<=M;++j) {
		
		if ( j==1 ) {
			init1(pr1,vf1,dql1[1][0],dql1[1][1]);	
			init2(pr2,vf2,dql2[1][0],dql2[1][1]);
		}

		el(dq1[j],p1[j][0],p1[j][1],Y,i);
		el(dq2[j],p2[j][0],p2[j][1],Y,i);
		
		el(dql1,pr1,vf1,X,j);
		el(dql2,pr2,vf2,X,j);
		
		ins1(dq1[j],p1[j][0],p1[j][1],map[i][j],i);
		ins2(dq2[j],p2[j][0],p2[j][1],map[i][j],i);

		min=dq1[j][p1[j][0]][0];	//imi iau minimul de pe coloana j
		max=dq2[j][p2[j][0]][0];	//si maximul

		ins1(dql1,pr1,vf1,min,j);
		ins2(dql2,pr2,vf2,max,j);

		dif=dql2[pr2][0]-dql1[pr1][0];
		
		if (j>=X && i>=Y) {
			if ( dif < best ) {
				best=dif;
				cnt=0;
			}
			if (dif==best)
				++cnt;
		}
	}	
		
}

//#undef int
int main() {
//#define int short
int i,j;
	freopen(fin,"r",stdin); freopen(fout,"w",stdout);
	
  int poz=0;
  #define dim 10000
  char buf[dim];
  fread(buf,1,dim,stdin);
  #define cit(x)                         \
  {                                      \
   x = 0;                                \
   while(buf[poz] < '0')                 \
    {                                    \
     ++poz;                              \
     if(poz == dim)                      \
       fread(buf,1,dim,stdin), poz = 0;  \
    }                                    \
   while(buf[poz] >= '0')                \
    {                                    \
     x = x*10 + buf[poz] - '0';          \
     if(++poz == dim)                    \
      fread(buf,1,dim,stdin), poz = 0;   \
    }                                    \
  }
	
	
	//scanf("%d%d%d",&N,&M,&P);
	cit(N) cit(M) cit(P) 

	for (i=1;i<=N;++i)
	for (j=1;j<=M;++j)
		//scanf("%d",&map[i][j]);
		cit(map[i][j])

	for (;P>0;--P) {
		//scanf("%d%d",&X,&Y);
		cit(X) cit(Y)
		best=INFI; cnt=0;
		
		go(X,Y);
		
		if (X!=Y) go(Y,X);
		
		printf("%d %d\n",best,cnt);
	}
//	#undef int
	return 0;
}