Cod sursa(job #1106263)

Utilizator ion824Ion Ureche ion824 Data 12 februarie 2014 18:01:33
Problema Struti Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.62 kb
#include<fstream>
#include<algorithm>
using namespace std;
const int NM = 1003;
const int INF = 0x3f3f3f3f;
static int a[NM][NM],mx[NM][NM],mn[NM][NM],difmin,nr;

void deq(int DX,int DY,int N,int M){
     int i,j,t,aij,mxij,mnij;
     int m1,m2,pm1=0,pm2=0;
     
     for(j=1;j<=M;++j)
      {
        m1=-INF; m2=INF;
        for(i=1;i<=N;++i)
        {
          aij=a[i][j];
          if(i<DX){
            if(aij > m1){ m1=aij; pm1=i; }
            if(aij < m2){ m2=aij; pm2=i; }  
                    }
          else
          { 
             if(aij > m1){ m1=aij; pm1=i; }
             
             if(pm1 == i-DX)
             {
               m1=-INF;
               for(t=i-DX+1;t<=i;++t)
                 if(a[t][j] > m1){ m1=a[t][j]; pm1=t; }
             }                               
             
             if(aij < m2){ m2=aij; pm2=i; }
                         
             if(pm2 == i-DX)
             {
               m2=INF;
               for(t=i-DX+1;t<=i;++t)
                 if(a[t][j] < m2){ m2=a[t][j]; pm2=t; }
             }                        
             
             mx[i][j]=m1;
             mn[i][j]=m2;
            }                
          } 
      }
      
      for(i=DX;i<=N;++i)
      {
        m1=-INF; m2=INF;
        for(j=1;j<=M;++j)
        {
          mxij=mx[i][j]; mnij=mn[i][j];
          if(j<DY) 
          {
            if(mxij > m1){ m1=mxij; pm1=j; }
            if(mnij < m2){ m2=mnij; pm2=j; }       
          }
          else
          {
            if(mxij > m1){ m1=mxij; pm1=j; }

            if(j - DY == pm1)
            {
              m1=-INF;
              for(t=j-DY+1;t<=j;++t)
                if(mx[i][t] > m1){ m1=mx[i][t]; pm1=t; }     
            }
           
            if(mnij < m2){ m2=mnij; pm2=j; }

            if(j - DY == pm2)
            {
              m2=INF;
              for(t=j-DY+1;t<=j;++t)
                if(mn[i][t] < m2){ m2=mn[i][t]; pm2=t; }    
            }         
            
            if(m1-m2==difmin)++nr;
            else
            if(m1 - m2 < difmin){ difmin=m1-m2; nr=1; }    
          }
        }
      }   
}


int main(){
    ios_base::sync_with_stdio(0);
    ifstream cin("struti.in");
    ofstream cout("struti.out");
    int N,M,P,i,j,DX,DY;
    
    cin>>N>>M>>P;
    for(i=1;i<=N;++i)
      for(j=1;j<=M;++j)
        cin>>a[i][j];
    
    while(P--){
      cin>>DX>>DY;
      
      difmin = INF; nr=0;
      deq(DX,DY,N,M);
      if(DX!=DY) deq(DY,DX,N,M);
      
      cout<<difmin<<' '<<nr<<'\n';     
    }
    
 return 0;   
}