NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#148714	#1445. 理想的正方形	CodingShark	100	740ms	13016kb	C++11	1.6kb	2022-07-17 18:16:09	2022-07-17 22:00:49

answer

#include <bits/stdc++.h>
using namespace std;
int a, b, n, h1, t1, h2, t2, ans = INT_MAX, s[1005][1005], f[1005][1005], g[1005][1005], q1[1005], q2[1005];

int main()
{
#ifndef ONLINE_JUDGE
    freopen("data.in", "r", stdin);
    // freopen("data.out", "w", stdout);
#endif
    scanf("%d %d %d", &a, &b, &n);
    for (int i = 1; i <= a; i++)
        for (int j = 1; j <= b; j++)
            scanf("%d", s[i] + j);
    for (int i = 1; i <= b; i++)
    {
        h1 = h2 = 1, t1 = t2 = 0;
        for (int j = 1; j <= a; j++)
        {
            if (h1 <= t1 && j - q1[h1] >= n)
                h1++;
            if (h2 <= t2 && j - q2[h2] >= n)
                h2++;
            while (h1 <= t1 && s[j][i] <= s[q1[t1]][i])
                t1--;
            q1[++t1] = j;
            while (h2 <= t2 && s[j][i] >= s[q2[t2]][i])
                t2--;
            q2[++t2] = j;
            if (j >= n)
                f[i][j] = s[q1[h1]][i], g[i][j] = s[q2[h2]][i];
        }
    }
    for (int i = n; i <= a; i++)
    {
        h1 = h2 = 1, t1 = t2 = 0;
        for (int j = 1; j <= b; j++)
        {
            if (h1 <= t1 && j - q1[h1] >= n)
                h1++;
            if (h2 <= t2 && j - q2[h2] >= n)
                h2++;
            while (h1 <= t1 && f[j][i] <= f[q1[t1]][i])
                t1--;
            q1[++t1] = j;
            while (h2 <= t2 && g[j][i] >= g[q2[t2]][i])
                t2--;
            q2[++t2] = j;
            if (j >= n)
                ans = min(ans, g[q2[h2]][i] - f[q1[h1]][i]);
        }
    }
    printf("%d", ans);
    return 0;
}

源文件, 语言: C++11

详细

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

Test #1:

score: 10

Accepted

time: 148ms

memory: 13016kb

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

memory: 13016kb

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

input:

output:

result:

ok single line: '2'

Test #4:

score: 10

Accepted

time: 3ms

memory: 9780kb

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

memory: 13016kb

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

memory: 11352kb

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

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

memory: 13016kb

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

memory: 11348kb

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

memory: 11412kb

input:

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

output:

998801667

result:

ok single line: '998801667'