NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#213842	#2406. Thief Masters	nodgd	100	1067ms	12996kb	C++11	1.5kb	2024-11-13 21:50:14	2024-11-13 23:08:53

answer

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000 + 5;

int A, B, N;
int a[MAX_N][MAX_N];
int mx[MAX_N][MAX_N], mn[MAX_N][MAX_N], Mx[MAX_N], Mn[MAX_N];
int q[MAX_N], qh, qt;

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", &a[i][j]);
        }
        qh = qt = 0;
        for (int j = 1; j <= B; j ++) {
            for (; qh < qt && a[i][q[qt - 1]] < a[i][j]; qt --);
            q[qt ++] = j;
            if (q[qh] <= j - N) qh ++;
            mx[i][j] = a[i][q[qh]];
        }
        qh = qt = 0;
        for (int j = 1; j <= B; j ++) {
            for (; qh < qt && a[i][q[qt - 1]] > a[i][j]; qt --);
            q[qt ++] = j;
            if (q[qh] <= j - N) qh ++;
            mn[i][j] = a[i][q[qh]];
        }
    }
    int ans = 1e9 + 233;
    for (int j = 1; j <= B; j ++) {
        qh = qt = 0;
        for (int i = 1; i <= A; i ++) {
            for (; qh < qt && mx[q[qt - 1]][j] < mx[i][j]; qt --);
            q[qt ++] = i;
            if (q[qh] <= i - N) qh ++;
            Mx[i] = mx[q[qh]][j];
        }
        qh = qt = 0;
        for (int i = 1; i <= A; i ++) {
            for (; qh < qt && mn[q[qt - 1]][j] > mn[i][j]; qt --);
            q[qt ++] = i;
            if (q[qh] <= i - N) qh ++;
            Mn[i] = mn[q[qh]][j];
            if (i >= N && j >= N) {
                ans = min(ans, Mx[i] - Mn[i]);
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}

源文件, 语言: C++11

详细

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

Test #1:

score: 10

Accepted

time: 142ms

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

memory: 1264kb

input:

output:

result:

ok single line: '2'

Test #3:

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 #4:

score: 10

Accepted

time: 219ms

memory: 12988kb

input:

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

output:

result:

ok single line: '1901899'

Test #5:

score: 10

Accepted

time: 63ms

memory: 7092kb

input:

500 500 50
79289095 232165705 955620938 481434262 465576217 112035388 50089892 459799006 181906335 3...

output:

995944328

result:

ok single line: '995944328'

Test #6:

score: 10

Accepted

time: 139ms

memory: 7104kb

input:

500 1000 80
499163842 331022295 940054497 684192083 248823911 842132608 629298697 398526298 98438040...

output:

998299092

result:

ok single line: '998299092'

Test #7:

score: 10

Accepted

time: 214ms

memory: 12996kb

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 #8:

score: 10

Accepted

time: 65ms

memory: 7096kb

input:

500 500 100
65532583 920409544 753795976 989349545 818384831 778207112 425141881 853270293 542112588...

output:

999172505

result:

ok single line: '999172505'

Test #9:

score: 10

Accepted

time: 73ms

memory: 7104kb

input:

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

output:

998801667

result:

ok single line: '998801667'

Test #10:

score: 10

Accepted

time: 152ms

memory: 12988kb

input:

1000 1000 100
629053044 957239666 456746076 940194386 201529807 592062148 244394389 825620014 223976...

output:

998862873

result:

ok single line: '998862873'

Extra Test:

score: 0

Extra Test Passed