NOI.AC
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #148780 | #1445. 理想的正方形 | Nikolaschka | 100 | 2441ms | 20924kb | C++ | 1.2kb | 2022-07-17 19:30:30 | 2022-07-17 22:05:21 |
answer
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int a,b,n,ans=0x3fffffff;
int as[1005][1005],Maxh[1005][1005],Minh[1005][1005];
int x1,x2,y1,y2,q1[1005],q2[1005];
int Maxz[1005][1005],Minz[1005][1005];
int main()
{
cin>>a>>b>>n;
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++) cin>>as[i][j];
}
for(int i=1;i<=a;i++)
{
x1=x2=y1=y2=1;
for(int j=1;j<=b;j++)
{
while(x1<y1&&j-q1[x1]>=n) x1++;
while(x2<y2&&j-q2[x2]>=n) x2++;
while(x1<y1&&as[i][q1[y1-1]]<=as[i][j]) y1--;
while(x2<y2&&as[i][q2[y2-1]]>=as[i][j]) y2--;
q1[y1++]=j;
q2[y2++]=j;
if(j>=n)
{
Maxh[i][j-n+1]=as[i][q1[x1]];
Minh[i][j-n+1]=as[i][q2[x2]];
}
}
}
for(int i=1;i<=b-n+1;i++)
{
x1=x2=y1=y2=1;
for(int j=1;j<=a;j++)
{
while(x1<y1&&j-q1[x1]>=n) x1++;
while(x2<y2&&j-q2[x2]>=n) x2++;
while(x1<y1&&Maxh[q1[y1-1]][i]<=Maxh[j][i]) y1--;
while(x2<y2&&Minh[q2[y2-1]][i]>=Minh[j][i]) y2--;
q1[y1++]=j;
q2[y2++]=j;
if(j>=n)
{
Maxz[j-n+1][i]=Maxh[q1[x1]][i];
Minz[j-n+1][i]=Minh[q2[x2]][i];
}
}
}
for(int i=1;i<=a-n+1;i++)
{
for(int j=1;j<=b-n+1;j++) ans=min(ans,Maxz[i][j]-Minz[i][j]);
}
cout<<ans;
return 0;
}
详细
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 434ms
memory: 20924kb
input:
1000 1000 100 804544523 340648618 718292412 235345736 704741136 942776831 741228920 463473302 677289...
output:
998893495
result:
ok single line: '998893495'
Test #2:
score: 10
Accepted
time: 548ms
memory: 20924kb
input:
1000 1000 100 629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...
output:
998862873
result:
ok single line: '998862873'
Test #3:
score: 10
Accepted
time: 3ms
memory: 9408kb
input:
5 4 2 1 2 5 6 0 17 16 0 16 17 0 1 2 10 2 1 1 2 3 2
output:
2
result:
ok single line: '2'
Test #4:
score: 10
Accepted
time: 7ms
memory: 13844kb
input:
100 100 10 2 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 1200001 ...
output:
908999
result:
ok single line: '908999'
Test #5:
score: 10
Accepted
time: 576ms
memory: 20924kb
input:
1000 1000 20 1 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 120000...
output:
1901899
result:
ok single line: '1901899'
Test #6:
score: 10
Accepted
time: 98ms
memory: 19360kb
input:
500 500 50 79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...
output:
995944328
result:
ok single line: '995944328'
Test #7:
score: 10
Accepted
time: 220ms
memory: 19244kb
input:
500 1000 80 499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...
output:
998299092
result:
ok single line: '998299092'
Test #8:
score: 10
Accepted
time: 244ms
memory: 20920kb
input:
1000 1000 80 102 134 429 251 299 109 264 669 727 296 112 550 270 270 544 660 131 546 968 219 113 678...
output:
998
result:
ok single line: '998'
Test #9:
score: 10
Accepted
time: 113ms
memory: 19164kb
input:
500 500 100 65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...
output:
999172505
result:
ok single line: '999172505'
Test #10:
score: 10
Accepted
time: 198ms
memory: 19160kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
