UOJ Logo

NOI.AC

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#159010#1445. 理想的正方形_______100826ms13088kbC++1.2kb2022-08-27 21:55:032022-08-27 21:55:05

answer

//P2216
#include<bits/stdc++.h>
using namespace std;
const int N=1009;
int n,m,x,a[N][N];
int q1[N],q2[N],h1=1,t1=0,h2=1,t2=0,mn[N][N],mx[N][N];//q[i] [i,i+x-1]
int ans=INT_MAX;
int main()
{
	cin>>n>>m>>x;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			scanf("%d",&a[i][j]);
	
	for(int i=1;i<=n;i++){
		h1=h2=1,t1=t2=0;
		for(int j=1;j<=m;j++){
			while(h1<=t1&&q1[h1]<j-x+1)h1++;
			while(h1<=t1&&a[i][q1[t1]]>=a[i][j])t1--;
			q1[++t1]=j;
			if(j>=x)mn[i][j-x+1]=a[i][q1[h1]];
			
			while(h2<=t2&&q2[h2]<j-x+1)h2++;
			while(h2<=t2&&a[i][q2[t2]]<=a[i][j])t2--;
			q2[++t2]=j;
			if(j>=x)mx[i][j-x+1]=a[i][q2[h2]];
//			cout<<a[i][q1[h1]]<<' '<<a[i][q2[h2]]<<"||";
		}
//		cout<<endl;
	}
	
//	for(int i=1;i<=n;i++){
//		for(int j=1;j<=m-x+1;j++)cout<<mn[i][j]<<' '<<mx[i][j]<<endl;
//	}
	
	for(int j=1;j<=m-x+1;j++){
		h1=h2=1,t1=t2=0;
		for(int i=1;i<=n;i++){
			while(h1<=t1&&q1[h1]<i-x+1)h1++;
			while(h1<=t1&&mn[q1[t1]][j]>=mn[i][j])t1--;
			q1[++t1]=i;
			
			while(h2<=t2&&q2[h2]<i-x+1)h2++;
			while(h2<=t2&&mx[q2[t2]][j]<=mx[i][j])t2--;
			q2[++t2]=i;
			if(i>=x)ans=min(ans,mx[q2[h2]][j]-mn[q1[h1]][j]);
		}
	}
	cout<<ans;
}

详细

小提示:点击横条可展开更详细的信息

Test #1:

score: 10
Accepted
time: 159ms
memory: 13088kb

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: 170ms
memory: 13084kb

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: 1312kb

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: 2436kb

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: 13088kb

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: 31ms
memory: 7168kb

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: 74ms
memory: 7176kb

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: 126ms
memory: 13088kb

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: 41ms
memory: 7168kb

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: 79ms
memory: 7172kb

input:

500 1000 100
456896744 779471086 578349238 52507342 192194992 156396237 475084995 775765435 96617474...

output:

998801667

result:

ok single line: '998801667'