Project Euler 011 Largest product in a grid

题意：给定一个$20\times 20$的矩阵，求最大的四个连续的数的乘积，连续意思是同一行连续或同一列连续或者斜线连续。
分析：暴力枚举四个数的起点，暴力枚举方向，$O(20^2 \cdot 4\cdot 4)$，可以用之前$008$的方法做到$O(20^2\cdot 4)$。

#include <bits/stdc++.h>

#define ll long long

#define pii std::pair<int,int>
#define mp std::make_pair
#define fi first
#define se second

#define SZ(x) (int)(x).size()
#define pb push_back

template<class T>inline void chkmax(T &x, const T &y) {if(x < y) x = y;}
template<class T>inline void chkmin(T &x, const T &y) {if(x > y) x = y;}

template<class T>
inline void read(T &x) {
    char c;int f = 1;x = 0;
    while(((c=getchar()) < '0' || c > '9') && c != '-');
    if(c == '-') f = -1;else x = c-'0';
    while((c=getchar()) >= '0' && c <= '9') x = x*10+c-'0';
    x *= f;
}
static int outn;
static char out[(int)2e7];
template<class T>
inline void write(T x) {
    if(x < 0) out[outn++] = '-', x = -x;
    if(x) {
        static int tmpn;
        static char tmp[20];
        tmpn = 0;
        while(x) tmp[tmpn++] = x%10+'0', x /= 10;
        while(tmpn) out[outn++] = tmp[--tmpn];
    }
    else out[outn++] = '0';
}

const int d[][2] = {{0, 1}, {1, 0}, {1, 1}, {-1, 1}};

int g[20][20];

int main() {
    for(int i = 0; i < 20; ++i)
        for(int j = 0; j < 20; ++j)
            read(g[i][j]);
    int max = 0;
    for(int t = 0; t < 4; ++t)
        for(int i = 0; i < 20; ++i)
            for(int j = 0; j < 20; ++j)
                if(i + d[t][0] * 3 < 20 && i + d[t][0] * 3 >= 0 && j + d[t][1] * 3 < 20) {
                    int prd = 1;
                    for(int k = 0; k < 4; ++k)
                        prd *= g[i + d[t][0] * k][j + d[t][1] * k];
                    chkmax(max, prd);
                }
    printf("%d\n", max);
    return 0;
}