Cod sursa(job #1811538)

Utilizator patrutoiuandreipatrutoiu andrei patrutoiuandrei Data 21 noiembrie 2016 12:19:31
Problema Struti Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.34 kb
#include <fstream>

#define Ndim 1002
using namespace std;
ifstream fin("struti.in");
ofstream fout("struti.out");
short int A[Ndim][Ndim],DQ[Ndim][Ndim],DQ2[2][Ndim][Ndim],N,M,P,DX,DY,Min,nrsol;
void deque_line(int d,bool OK)
{
    int i,j;
    for(i=1;i<=N;i++)
    {
        int st=1,dr=1;
        DQ[i][0] = DQ[i][1] = 0;
        for(j=1;j<=M;j++)
        {
            if(j-st + 1 > d)
                st++;
            if(OK==1)
                while(dr>=st && A[i][j]>A[i][DQ[i][dr]])
                    dr--;
            else
                while(dr>=st && A[i][j]<A[i][DQ[i][dr]])
                    dr--;
            DQ[i][++dr] = j;
        }
    }
}
void deque_col(int d,int OK)
{
    int i,j;
    for(j=1;j<=M;j++)
    {
        int st=1,dr=1;
        DQ2[OK][1][j] = DQ2[OK][0][j] = 0;
        for(i=1;i<=N;i++)
        {
            if(i-st + 1 > d)
                st++;
            if(OK==1)
                while(dr>=st && DQ[i][j] > DQ[DQ2[OK][dr][j]][j])
                    dr--;
            else
                while(dr>=st && DQ[i][j] < DQ[DQ2[OK][dr][j]][j])
                    dr--;
            DQ2[OK][++dr][j] = i;
        }
    }
}
int main()
{
    fin>>N>>M>>P;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=M;j++)
            fin>>A[i][j];

    while(P--)
    {
        fin>>DX>>DY;
        deque_line(DX,1);
        deque_col(DY,1);
        deque_line(DX,0);
        deque_col(DY,0);
        Min = 8001;
        nrsol = 0;
        for(int i=1;i<=N-DY+1;i++)
            for(int j=DX;j<=M-DX+1;j++)
                if(DQ2[1][i][j] - DQ2[0][i][j] < Min)
                {
                    Min = DQ2[1][i][j] - DQ2[0][i][j];
                    nrsol = 1;
                }
                else if(DQ2[1][i][j] - DQ2[0][i][j] == Min)
                    nrsol++;
        deque_line(DY,1);
        deque_col(DX,1);
        deque_line(DY,0);
        deque_col(DX,0);

        for(int i=1;i<=N-DX+1;i++)
            for(int j=1;j<=M-DY+1;j++)
                if(DQ2[1][i][j] - DQ2[0][i][j] < Min)
                {
                    Min = DQ2[1][i][j] - DQ2[0][i][j];
                    nrsol = 1;
                }
                else if(DQ2[1][i][j] - DQ2[0][i][j] == Min)
                    nrsol++;
        fout<<Min<<' '<<nrsol<<'\n';
    }
    return 0;
}