[hihocoder][Offer收割]编程练习赛44

扫雷游戏

#pragma comment(linker, "/STACK:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<functional>
#include<math.h>
//#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
void makedata() {
    freopen("input.txt", "w", stdout);
    cout <<  << endl;

    for(int i = ; i < ; i++) cout <<  << ' ';

    fclose(stdout);
}

char a[][];
const int dx[] = { -, , , , -, , , - };
const int dy[] = { , , , -, , , -, - };

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    int n;
    cin >> n;

    for(int i = ; i <= n; i++) {
        for(int j = ; j <= n; j++) {
            cin >> a[i][j];
        }
    }

    for(int i = ; i <= n + ; i++) {
        a[][i] = '.';
        a[n + ][n + ] = '.';
        a[i][] = '.';
        a[i][n + ] = '.';
    }

    for(int i = ; i <= n; i++) {
        for(int j = ; j <= n; j++) {
            int tmp = ;

            for(int k = ; k < ; k++) {
                if(a[i + dx[k]][j + dy[k]] == '*') tmp++;
            }

            if(a[i][j] == '*') cout << a[i][j];
            else cout << tmp;
        }

        cout << endl;
    }

    return ;
}

最大子矩阵2

#pragma comment(linker, "/STACK:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<functional>
#include<math.h>
//#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef queue<int> QI;

void makedata() {
    freopen("input.txt", "w", stdout);
    fclose(stdout);
}

lint a[][], s[][];
inline lint sum(int x1, int y1, int x2, int y2) {
    if (x1 ==  && y1 == ) return s[x2][y2];
    if (x1 !=  && y1 != ) return s[x2][y2] - s[x1 - ][y2] - s[x2][y1 - ] + s[x1 - ][y1 - ];
    if (x1 ==  && y1 != ) return s[x2][y2] - s[x2][y1 - ];
    if (x1 !=  && y1 == ) return s[x2][y2] - s[x1 - ][y2];
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    //makedata();
    std::ios::sync_with_stdio(), cin.tie();
    int n, m;
    lint k;
    cin >> n >> m >> k;
    for (int i = ; i < n; i++) {
        for (int j = ; j < m; j++) {
            cin >> a[i][j];
        }
    }
    memset(s, , sizeof(s));
    s[][] = a[][];
    for (int i = ; i < n; i++) s[i][] = a[i][] + s[i - ][];
    for (int i = ; i < m; i++) s[][i] = a[][i] + s[][i - ];
    for (int i = ; i < n; i++) {
        for (int j = ; j < m; j++) {
            s[i][j] = s[i][j - ] + s[i - ][j] - s[i - ][j - ] + a[i][j];
        }
    }
    int ans = -;
    for (int x1 = ; x1 < n; x1++) {
        for (int y1 = ; y1 < m; y1++) {
            if ((n - x1) * (m - y1) <= ans) break;
            for (int x2 = n - ; x2 >= x1 ; x2--) {
                if ((x2 - x1 + ) * (m - y1) <= ans) break;
                for (int y2 = m - ; y2 >= y1; y2--) {
                    if ((x2 - x1 + ) * (y2 - y1 + ) <= ans) break;
                    if (sum(x1, y1, x2, y2) <= k) ans = max(ans, (x2 - x1 + ) * (y2 - y1 + ));
                }
            }
        }
    }
    cout << ans << endl;
    return ;
}