NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#148765	#1445. 理想的正方形	gaojieming	100	732ms	12992kb	C++	1.7kb	2022-07-17 19:10:15	2022-07-17 19:10:17

answer

#include<bits/stdc++.h>
#define ll long long
#define il inline
#define pn putchar('\n')
#define maxint 2147483647
#define maxn 1005
using namespace std;
il int min(const int x,const int y){return x<y?x:y;}
il int max(const int x,const int y){return x>y?x:y;}
il int abs(const int x){return x<0?-x:x;}
int n,m,k,l,r,ans=maxint;
int a[maxn][maxn],b[maxn][maxn],c[maxn][maxn],q[maxn],maxx[maxn],minn[maxn];
signed main()
{
 //   freopen("in.txt","r",stdin);
    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++)
    {
        l=1,r=0;
        for(int j=1;j<=m;j++)
        {
            while(l<=r&&a[i][j]>=a[i][q[r]])r--;
            q[++r]=j;
            while(l<=r&&q[r]-q[l]+1>k)l++;
            if(j>=k)b[i][j]=a[i][q[l]];
            else b[i][j]=-maxint;
        }
        l=1,r=0;
        for(int j=1;j<=m;j++)
        {
            while(l<=r&&a[i][j]<=a[i][q[r]])r--;
            q[++r]=j;
            while(l<=r&&q[r]-q[l]+1>k)l++;
            if(j>=k)c[i][j]=a[i][q[l]];
            else c[i][j]=maxint;
        }
    }
    for(int j=k;j<=m;j++)
    {
        l=1,r=0;
        for(int i=1;i<=n;i++)
        {
            while(l<=r&&b[i][j]>=b[q[r]][j])r--;
            q[++r]=i;
            while(l<=r&&q[r]-q[l]+1>k)l++;
            if(j>=k)maxx[i]=b[q[l]][j];
        }
        l=1,r=0;
        for(int i=1;i<=n;i++)
        {
            while(l<=r&&c[i][j]<=c[q[r]][j])r--;
            q[++r]=i;
            while(l<=r&&q[r]-q[l]+1>k)l++;
            if(j>=k)minn[i]=c[q[l]][j];
        }
        for(int i=k;i<=n;i++)
            ans=min(ans,maxx[i]-minn[i]);
    }
    printf("%d",ans);
	return 0;
}

源文件, 语言: C++

详细

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

Test #1:

score: 10

Accepted

time: 134ms

memory: 12992kb

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

memory: 12992kb

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

input:

output:

result:

ok single line: '2'

Test #4:

score: 10

Accepted

time: 0ms

memory: 2376kb

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

memory: 12992kb

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

memory: 7096kb

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

memory: 7104kb

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

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

memory: 7092kb

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

memory: 7100kb

input:

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

output:

998801667

result:

ok single line: '998801667'