【递推】凯撒大帝 题解

dp[i][j]=min{dp[i][j-1],dp[i-1][j],dp[i-1][j-1]}+1;
ans[dp[i][j]]++;
ans[l]=$\sum_{i=l}^{min(n,m)}ans[i]$

#include <cstdio>
#include <iostream>
#define minn(a, b, c) min(min(a, b), c)

using namespace std;

const int maxn = 2005;
char opt;
int n,m,t;
int pre[maxn][maxn],ans[maxn];

inline char read() {
    register char ch = getchar();
    while(ch == ' ' || ch  == '\n') ch = getchar();
    return ch;
}

int main(){
    scanf("%d%d%d",&n,&m,&t);
    for(register int i = 1; i <= n; i++) {
        for(register int j = 1; j <= m; j++) {
            opt = read();
            if(opt == '0') pre[i][j] = 0;
            else pre[i][j] = minn(pre[i][j-1], pre[i-1][j], pre[i-1][j-1])+1;
            ans[pre[i][j]]++;
        }
    }
    for(register int i = min(n, m); i >= 1; i--) ans[i] += ans[i+1];
    for(register int u, i = 1; i <= t; i++) scanf("%d",&u), printf("%d\n",ans[u]);
    return 0;
}