UOJ Logo

NOI.AC

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#211027#2406. Thief MastersFHL1002450ms12304kbC++11898b2024-08-09 09:01:052024-08-09 12:32:06

answer

#include <cstdio>
#include <algorithm>
#pragma GCC optimize(2)
using namespace std;
const int N = 1005, INF = 1e9 + 7;
int a, b, n, g[N][N], ans = INF, f1[N][N], f2[N][N];
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", &g[i][j]);
			f1[i][j] = g[i][j];
			f2[i][j] = g[i][j];
		}
	for (int k = 1; k <= n - 1; k ++ )
        for (int i = 1; i <= a - 1; i ++ )
            for (int j = 1; j <= b - 1; j ++ ) {
                f1[i][j] = max(g[i][j], max(f1[i + 1][j + 1], max(f1[i + 1][j], f1[i][j + 1])));
                f2[i][j] = min(g[i][j], min(f2[i + 1][j + 1], min(f2[i + 1][j], f2[i][j + 1])));
            }
    for (int i = 1; i <= a - n + 1; i ++ )
        for (int j = 1; j <= b - n + 1; j ++ )
            ans = min(ans, f1[i][j] - f2[i][j]);
    printf("%d\n", ans);
    return 0;
}

详细

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

Test #1:

score: 10
Accepted
time: 648ms
memory: 12300kb

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

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

score: 10
Accepted
time: 0ms
memory: 1684kb

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

score: 10
Accepted
time: 158ms
memory: 12300kb

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

score: 10
Accepted
time: 83ms
memory: 6404kb

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: 211ms
memory: 6412kb

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: 398ms
memory: 12304kb

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

score: 10
Accepted
time: 135ms
memory: 6400kb

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: 241ms
memory: 6412kb

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: 576ms
memory: 12300kb

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