NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #165401 | #1445. 理想的正方形 | lyp1219 | 100 | 838ms | 40088kb | C++ | 1.9kb | 2022-11-11 07:40:40 | 2022-11-11 07:40:41 |
answer
#include<bits/stdc++.h>
using namespace std;
const int N=2010;
int a,b,n,k[N][N];
int maxx[N][N],minn[N][N],MAX[N][N],MIN[N][N];
int q1[N],q2[N];
int main()
{
scanf("%d%d%d",&a,&b,&n);
for(int i=1;i<=a;i++)
{
for(int j=1;j<=b;j++)
{
scanf("%d",&k[i][j]);
}
}
for(int i=1;i<=a;i++)
{
memset(q1,0,sizeof q1);
memset(q2,0,sizeof q2);
// q1[1]=q2[2]=1;
int l1=1,r1=0;
int l2=1,r2=0;
for(int j=1;j<=b;j++)
{
while(l1<=r1&&j-q1[l1]+1>n)l1++;
while(l2<=r2&&j-q2[l2]+1>n)l2++;
while(l1<=r1&&k[i][q1[r1]]>=k[i][j])r1--;
while(l2<=r2&&k[i][q2[r2]]<=k[i][j])r2--;
q2[++r2]=j;
q1[++r1]=j;
if(j>=n)maxx[i][j]=k[i][q2[l2]];
if(j>=n)minn[i][j]=k[i][q1[l1]];
}
}
// cout<<"MAXX:\n";
// for(int i=1;i<=a;i++)
// {
// for(int j=n;j<=b;j++)
// {
// cout<<maxx[i][j]<<" ";
// }
// cout<<endl;
// }
// cout<<"MINN:\n";
// for(int i=1;i<=a;i++)
// {
// for(int j=n;j<=b;j++)
// {
// cout<<minn[i][j]<<" ";
// }
// cout<<endl;
// }
for(int j=n;j<=b;j++)
{
memset(q1,0,sizeof q1);
memset(q2,0,sizeof q2);
// q1[1]=q2[1]=1;
int l1=1,r1=0;
int l2=1,r2=0;
for(int i=1;i<=a;i++)
{
while(l1<=r1&&i-q1[l1]+1>n)l1++;
while(l2<=r2&&i-q2[l2]+1>n)l2++;
while(l1<=r1&&minn[q1[r1]][j]>=minn[i][j])r1--;
while(l2<=r2&&maxx[q2[r2]][j]<=maxx[i][j])r2--;
q2[++r2]=i;
q1[++r1]=i;
if(i>=n)MAX[i][j]=maxx[q2[l2]][j];
if(i>=n)MIN[i][j]=minn[q1[l1]][j];
}
}
// cout<<"MAX:\n";
// for(int i=n;i<=a;i++)
// {
// for(int j=n;j<=b;j++)
// {
// cout<<MAX[i][j]<<" ";
// }
// cout<<endl;
// }
// cout<<"MIN:\n";
// for(int i=n;i<=a;i++)
// {
// for(int j=n;j<=b;j++)
// {
// cout<<MIN[i][j]<<" ";
// }
// cout<<endl;
// }
int ans=2e9;
for(int i=n;i<=a;i++)
{
for(int j=n;j<=b;j++)
{
ans=min(ans,MAX[i][j]-MIN[i][j]);
}
}
cout<<ans;
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 159ms
memory: 37644kb
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: 167ms
memory: 37648kb
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: 0ms
memory: 1320kb
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: 0ms
memory: 3312kb
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: 146ms
memory: 40088kb
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: 33ms
memory: 15152kb
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: 71ms
memory: 19132kb
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: 133ms
memory: 38248kb
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: 43ms
memory: 14216kb
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: 86ms
memory: 18688kb
input:
500 1000 100 456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...
output:
998801667
result:
ok single line: '998801667'
