Cod sursa(job #2811179)

Utilizator daria_pDaria Popescu daria_p Data 1 decembrie 2021 14:03:31
Problema Struti Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.19 kb
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("struti.in");
ofstream fout("struti.out");
int n,i,j,m,v[1005][1005],k,x,y,mx[1005][1005],mn[1005][1005],mi,nr;
deque <int> dmin,dmax;
void coloane(int a,int b)
{
    int i,j;
    for(j=1;j<=m;j++)
    {
        dmin.clear();
        dmax.clear();
        for(i=1; i<=n; i++)
        {
            while(!dmax.empty() && v[i][j]>=v[dmax.back()][j])
            {
                dmax.pop_back();
            }
            while(!dmin.empty() && v[i][j]<=v[dmin.back()][j])
            {
                dmin.pop_back();
            }
            dmax.push_back(i);
            dmin.push_back(i);
            if(dmax.front()==i-a) dmax.pop_front();
            if(dmin.front()==i-a) dmin.pop_front();
            mx[i][j]=v[dmax.front()][j];
            mn[i][j]=v[dmin.front()][j];
        }
    }
}
void linii(int a,int b)
{
    int i,j;
    for(i=a;i<=n;i++)
    {
        dmin.clear();
        dmax.clear();
        for(j=1;j<=m;j++)
        {
            while(!dmax.empty()&&mx[i][j]>=mx[i][dmax.back()])
            {
                dmax.pop_back();
            }
            while(!dmin.empty()&&mn[i][j]<=mn[i][dmin.back()])
            {
                dmin.pop_back();
            }
            dmax.push_back(j);
            dmin.push_back(j);
            if(dmax.front()==j-b) dmax.pop_front();
            if(dmin.front()==j-b) dmin.pop_front();
            if(j>=b&&mx[i][dmax.front()]-mn[i][dmin.front()]<mi)
            {
                mi=mx[i][dmax.front()]-mn[i][dmin.front()];
                nr=1;
            }
            else if(j>=b&&mx[i][dmax.front()]-mn[i][dmin.front()]==mi)
            {
                nr++;
            }
        }
    }
}
int main()
{
    fin >>n>>m>>k;
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=m;j++)
        {
            fin >>v[i][j];
        }
    }
    for (i=1;i<=k;i++)
    {
        fin >>x>>y;
        mi=999999;
        nr=0;
        coloane(x,y);
        linii(x,y);
        if (x!=y)
        {
            coloane(y,x);
            linii(y,x);
        }
        fout <<mi<<" "<<nr<<'\n';
    }
    return 0;
}