ll res = -oo; for(int k=1; k<=n; k++) for(int i=1; i<=n-k+1; i++) for(int j=1; j<=n-k+1; j++) { f[i][j][k] = f[i][j][k — 1] + a[i + k — 1] * b[j + k — 1]; res = max(res, f[i][j][k]); } cout << res;

ll res = -oo; for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) for(int k=1; k<=n; k++) { if(k + i > n || k + j > n) break; f[i][j][k] = f[i][j][k — 1] + a[i + k — 1] * b[j + k — 1]; res = max(res, f[i][j][k]); } cout << res;