NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#205569	#1445. 理想的正方形	one_zero_four_zero	100	968ms	20784kb	C++11	3.0kb	2024-07-18 17:51:32	2024-07-18 20:03:11

answer

#include<bits/stdc++.h>
#define __len(x) (((1LL << (int)(3.3 * x + 1)) + 15))
using namespace std;

int a, b, n, ans = 2000000009;
deque<int> qmax, qmin;
int val[1005][1005];
int pre1[2][1005][1005]; // max & min
int pre2[2][1005][1005];

int main(){
#ifndef ONLINE_JUDGE
    freopen("../data.in","r",stdin);
    freopen("../data.out","w",stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    scanf("%d %d %d", &a, &b, &n);
    for (int i = 1; i <= a; i ++){
        for (int j = 1; j <= b; j ++){
            scanf("%d", &val[i][j]);
        }
    }
    for (int i = 1; i <= a; i ++){ // 1.row
        qmax.clear(), qmin.clear();
        for (int j = 1; j <= b; j ++){
            while (qmax.size() && qmax.front() <= j - n){
                qmax.pop_front();
            }
            while (qmin.size() && qmin.front() <= j - n){
                qmin.pop_front();
            }
            while (qmax.size() && val[i][qmax.back()] <= val[i][j]){
                qmax.pop_back();
            }
            while (qmin.size() && val[i][qmin.back()] >= val[i][j]){
                qmin.pop_back();
            }
            qmax.push_back(j), qmin.push_back(j);
            if (j < n) continue;
            pre1[0][i][j] = val[i][qmax.front()];
            pre1[1][i][j] = val[i][qmin.front()];
        }
    }
    // for (int i = 1; i <= a; i ++){
    //     for (int j = 1; j <= b; j ++){
    //         cout << pre1[0][i][j] << " ";
    //     }
    //     cout << ";\n";
    // }
    // for (int i = 1; i <= a; i ++){
    //     for (int j = 1; j <= b; j ++){
    //         cout << pre1[1][i][j] << " ";
    //     }
    //     cout << ";;\n";
    // }
    for (int j = n; j <= b; j ++){
        qmax.clear(), qmin.clear();
        for (int i = 1; i <= a; i ++){
            while (qmax.size() && qmax.front() <= i - n){
                qmax.pop_front();
            }
            while (qmin.size() && qmin.front() <= i - n){
                qmin.pop_front();
            }
            while (qmax.size() && pre1[0][qmax.back()][j] <= pre1[0][i][j]){
                qmax.pop_back();
            }
            while (qmin.size() && pre1[1][qmin.back()][j] >= pre1[1][i][j]){
                qmin.pop_back();
            }
            qmax.push_back(i), qmin.push_back(i);
            if (i < n) continue;
            pre2[0][i][j] = pre1[0][qmax.front()][j];
            pre2[1][i][j] = pre1[1][qmin.front()][j];
        }
    }
    // for (int i = 1; i <= a; i ++){
    //     for (int j = 1; j <= b; j ++){
    //         cout << pre2[0][i][j] << " ";
    //     }
    //     cout << "[]\n";
    // }
    // for (int i = 1; i <= a; i ++){
    //     for (int j = 1; j <= b; j ++){
    //         cout << pre2[1][i][j] << " ";
    //     }
    //     cout << "[]\n";
    // }
    for (int i = n; i <= a; i ++){
        for (int j = n; j <= b; j ++){
            ans = min(ans, pre2[0][i][j] - pre2[1][i][j]);
        }
    }
    printf("%d\n",ans);

    return 0;
}

源文件, 语言: C++11

详细

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

Test #1:

score: 10

Accepted

time: 179ms

memory: 20152kb

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

memory: 20156kb

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

input:

output:

result:

ok single line: '2'

Test #4:

score: 10

Accepted

time: 3ms

memory: 3172kb

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

memory: 20784kb

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

memory: 10720kb

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

memory: 10496kb

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

memory: 20312kb

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

memory: 10328kb

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

memory: 10340kb

input:

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

output:

998801667

result:

ok single line: '998801667'