题意: n ∗ m n*m n∗m的矩阵,在 ( i , j ) (i,j) (i,j)处有 a [ i ] [ j ] a[i][j] a[i][j]个钻石,且可以让所有钻石的单价上涨 b [ i ] [ j ] b[i][j] b[i][j],问从 ( 1 , 1 ) (1,1) (1,1)出发,每一次向下或向右移动到达 ( n , n ) (n,n) (n,n)后,所走过得位置的钻石最多可以卖多少钱?
解法:记 d p [ i ] [ j ] [ k ] dp[i][j][k] dp[i][j][k]为到达 i , j i,j i,j位置时所持有的钻石为 k k k时可以卖多少钱, d p [ i ] [ j ] [ k ] dp[i][j][k] dp[i][j][k]可以由 d p [ i − 1 ] [ j ] [ x ] dp[i-1][j][x] dp[i−1][j][x]和 d p [ i ] [ j − 1 ] [ y ] dp[i][j-1][y] dp[i][j−1][y]转移而来,由于结果由两个变量:钻石数量和钻石单价控制,我们无法确定在这个位置中的最优解,但我们是可以确定非最优解的:数量少且单价低的一定是非最优解,所以我们确定 ( i , j ) (i,j) (i,j)位置的可能最优解时,可以先将 ( i − 1 , j ) (i-1,j) (i−1,j)和 ( i , j − 1 ) (i,j-1) (i,j−1)的可能最优解对数量进行升序排列,将单价低且数量少的从这个序列中剔除,剩下的可能最优解与 ( i , j ) (i,j) (i,j)位置上的 a [ i ] [ j ] , b [ i ] [ j ] a[i][j],b[i][j] a[i][j],b[i][j]构成 ( i , j ) (i,j) (i,j)位置上的最优解
AcCode:
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#define pint std::pair<int,int>
#define make std::make_pair
#define int long long
const int N = 110;
int a[N][N], b[N][N];
pint rem[N * N * N];
std::vector<pint> vec[N][N];
int top = 0;
inline int max(int a, int b) { return (a > b) ? a : b; }
inline void check(pint x) {
while (top && rem[top].second <= x.second) top--;
if (!top || rem[top].first < x.first) rem[++top] = x;
}
inline void solve(std::vector<pint> a, std::vector<pint> b, std::vector<pint>& ans) {
int sz_a = a.size(), sz_b = b.size();
top = 0;
int topa = 0, topb = 0;
while (topa < sz_a && topb < sz_b) check((a[topa].first < b[topb].first) ? a[topa++] : b[topb++]);
while (topa < sz_a) check(a[topa++]);
while (topb < sz_b) check(b[topb++]);
for (int i = 1; i <= top; i++) ans.push_back(rem[i]);
}
signed main() {
int t; scanf("%lld", &t);
while (t--) {
int n; scanf("%lld", &n);
for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf("%lld", &a[i][j]), vec[i][j].clear();
for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) scanf("%lld", &b[i][j]);
vec[1][1].push_back(make(a[1][1], b[1][1]));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == 1 && j == 1) continue;
else if (i == 1) vec[i][j] = vec[i][j - 1];
else if (j == 1) vec[i][j] = vec[i - 1][j];
else solve(vec[i - 1][j], vec[i][j - 1], vec[i][j]);
for (auto& v : vec[i][j])v.first += a[i][j], v.second += b[i][j];
}
}
int ans = 0;
for (auto& v : vec[n][n]) ans = max(ans, 1ll * v.first * v.second);
printf("%lld\n", ans);
}
}