Pagini recente » Cod sursa (job #1108427) | Cod sursa (job #719288) | Cod sursa (job #634222) | Cod sursa (job #2447626) | Cod sursa (job #2811138)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("struti.in");
ofstream fout("struti.out");
int n,i,j,m,a[1005][1005],k,x,y,mx[1005][1005],mn[1005][1005],mi,nr;
deque <int> dmin,dmax;
void coloane(int x,int y)
{
int i,j;
for (j=1;j<=m;j++)
{
dmin.clear();
dmax.clear();
for (i=1;i<=n;i++)
{
while (!dmin.empty() && a[i][j]<=a[dmin.back()][j])
{
dmin.pop_back();
}
while (!dmax.empty() && a[i][j]>=a[dmax.back()][j])
{
dmax.pop_back();
}
dmin.push_back(i);
dmax.push_back(i);
if (dmin.front()<=i-x) dmin.pop_front();
if (dmax.front()<=i-x) dmax.pop_front();
mx[i][j]=a[dmax.front()][j];
mn[i][j]=a[dmin.front()][j];
}
}
}
void linii(int x,int y)
{
int i,j;
for (i=x;i<=n;i++)
{
dmax.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-y) dmax.pop_front();
if (dmin.front()<=j-y) dmin.pop_front();
if(j>=y&&mx[i][dmax.front()]-mn[i][dmin.front()]<mi)
{
mi=mx[i][dmax.front()]-mn[i][dmin.front()];
nr=1;
}
else if(j>=y&&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 >>a[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;
}