NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#148839	#1445. 理想的正方形	donmaid	100	829ms	20908kb	C++	1.3kb	2022-07-17 21:38:20	2022-07-17 22:09:49

answer

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[1005][1005],q[1005],p[1005],am[1005][1005],im[1005][1005],ma[1005][1005],mi[1005][1005],ql=1,qr,pl=1,pr;
int n,m,k,ans=0x3f3f3f3f;
int main(){
    scanf("%d%d%d",&n,&m,&k);
    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++){
    	ql=pl=1,qr=pr=0;
        for(int j=1;j<=m;j++){
      		while(ql<=qr&&a[i][q[qr]]<=a[i][j])qr--; 
        	q[++qr]=j;
     		while(pl<=pr&&a[i][p[pr]]>=a[i][j])pr--; 
            p[++pr]=j;
            while(ql<=qr&&q[ql]<j-k+1) ql++;
            while(pl<=pr&&p[pl]<j-k+1) pl++;
            ma[i][j]=a[i][q[ql]];
            mi[i][j]=a[i][p[pl]];
           }
    }
    for(int i=1;i<=m;i++){
    	ql=pl=1,qr=pr=0;
        for(int j=1;j<=n;j++){
      		while(ql<=qr&&ma[q[qr]][i]<=ma[j][i])qr--; 
            q[++qr]=j;
     		while(pl<=pr&&mi[p[pr]][i]>=mi[j][i])pr--; 
            p[++pr]=j;
            while(ql<=qr&&q[ql]<j-k+1) ql++;
            while(pl<=pr&&p[pl]<j-k+1) pl++;
            am[j][i]=ma[q[ql]][i];
            im[j][i]=mi[p[pl]][i];
        }
    }
    for(int i=k;i<=n;i++){
        for(int j=k;j<=m;j++){
        	ans=min(ans,am[i][j]-im[i][j]);
        }
	}
	printf("%d",ans);
	return 0;
}

源文件, 语言: C++

详细

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

Test #1:

score: 10

Accepted

time: 168ms

memory: 20904kb

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: 210ms

memory: 20904kb

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

input:

output:

result:

ok single line: '2'

Test #4:

score: 10

Accepted

time: 1ms

memory: 13864kb

input:

100 100 10
2 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 1200001 ...

output:

result:

ok single line: '908999'

Test #5:

score: 10

Accepted

time: 127ms

memory: 20900kb

input:

1000 1000 20
1 100001 200001 300001 400001 500001 600001 700001 800001 900001 1000001 1100001 120000...

output:

result:

ok single line: '1901899'

Test #6:

score: 10

Accepted

time: 31ms

memory: 19532kb

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: 68ms

memory: 19536kb

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: 119ms

memory: 20908kb

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:

result:

ok single line: '998'

Test #9:

score: 10

Accepted

time: 35ms

memory: 19532kb

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: 70ms

memory: 19532kb

input:

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

output:

998801667

result:

ok single line: '998801667'