pe150

最新推荐文章于 2023-11-10 14:08:35 发布

dezhonger

最新推荐文章于 2023-11-10 14:08:35 发布

阅读量308

点赞数

分类专栏： pe

本文链接：https://blog.csdn.net/dezhonger/article/details/102652528

版权

pe 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

求出每行的前缀和，然后暴力就可以了

O(N^3)

public class PE150 {
    static long t = 0;

    final int n = 1000;
    long[][] a = new long[n + 1][n + 1];
    long[][] sum = new long[n + 1][n + 1];

    static long next() {
        t = (615949 * t + 797807) % (1 << 20);
        return t - (1 << 19);
    }


    long res = Long.MAX_VALUE;

    public static void main(String[] args) {
        PE150 pe150 = new PE150();
        pe150.init();
        pe150.run();

    }

    void run() {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                long tmp = a[i][j];
                updateRes(tmp);
                for (int k = i + 1; k <= n; k++) {
                    //这一行的末尾列
                    int l = j + k - i;
                    //这一行的数字个数
                    int curNumber = k - i + 1;
                    tmp += sum[k][l] - sum[k][l - curNumber];
                    updateRes(tmp);
                }
            }
        }
        System.out.println(res);
    }

    private void updateRes(long tmp) {
        res = Math.min(res, tmp);
    }


    void init() {
        //初始化数组
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                a[i][j] = next();
            }
        }
        //每行前缀和
        for (int i = 1; i <= n; i++) {
            sum[i][0] = 0;
            for (int j = 1; j <= i; j++) {
                sum[i][j] = sum[i][j - 1] + a[i][j];
            }
        }

    }
}