Colored Rectangles(贪心/dp)

题目
题意：给定$red,green,blue$三种颜色的板子，数量分别有$r,g,b$对，长度为$r_i,g_j,b_k$。用两种颜色组成一个长方形，问能组成的最大面积。

思路：贪心，大的长度和大的长度匹配，这样可以最优。预处理排序，定义$dp[i][j][k]$表示取前$i,j,k$个木板，能组成的最大面积，答案为$dp[r][g][b]$。dp转移方程比较显然。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
const int maxn = 205;

int nr, ng, nb;
int r[maxn], g[maxn], b[maxn];
ll dp[maxn][maxn][maxn];

bool cmp(const ll &x, const ll &y) {
    return x < y;
}
int main() {

    scanf("%d%d%d", &nr, &ng, &nb);
    for(int i = 0;i < nr; ++i) {
        scanf("%d", &r[i]);
    }
    for(int i = 0;i < ng; ++i) {
        scanf("%d", &g[i]);
    }
    for(int i = 0;i < nb; ++i) {
        scanf("%d", &b[i]);
    }
    sort(r, r + nr, cmp);
    sort(g, g + ng, cmp);
    sort(b, b + nb, cmp);
    memset(dp, 0, sizeof(dp));
    dp[1][1][0] = r[0] * g[0];
    dp[1][0][1] = r[0] * b[0];
    dp[0][1][1] = g[0] * b[0];

    for (int i = 1; i <= nr; ++i) {
        for (int j = 1; j <= ng; ++j) {
            dp[i][j][0] = dp[i-1][j-1][0] + r[i-1] * g[j-1];
        }
    }
    for (int i = 1; i <= nr; ++i) {
        for (int k = 1; k <= nb; ++k) {
            dp[i][0][k] = dp[i-1][0][k-1] + r[i-1] * b[k-1];
        }
    }
    for (int j = 1; j <= ng; ++j) {
        for (int k = 1; k <= nb; ++k) {
            dp[0][j][k] = dp[0][j-1][k-1] + g[j-1] * b[k-1];
        }
    }

    for (int i = 1; i <= nr; ++i) {
        for (int j = 1; j <= ng; ++j) {
            for (int k = 1; k <= nb; ++k) {
                dp[i][j][k] = dp[i-1][j-1][k] + r[i-1] * g[j-1];
                dp[i][j][k] = max(dp[i][j][k], dp[i-1][j][k-1] + r[i-1] * b[k-1]);
                dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k-1] + g[j-1] * b[k-1]);
            }
        }
    }
    printf("%lld\n", dp[nr][ng][nb]);

}