NC14526 购物(DP)

题目链接

题意：
$共n天，每天有m种糖果可以买，也可以不买$
$价钱是c_{ij}$
$每天买k个糖果需要额外支付k^2的钱$
$要每天都能有一个糖果吃$
$问最少花多少钱每天都能有糖果吃$
题解：
$n,m<=300$
$最优解，并且没有策略进行贪心$
$那么考虑dp$
$dp[i][j]第i天已经有j个糖果的最小花费$
$对于每一天肯定优先买最便宜的几个糖果$
$那么对这一天的糖果排序，并且求出前缀和$
$然后开始枚举每一天枚举总共买糖果的数量和当天购买糖果的数量$
$进行转移即可$
$最后dp[n][n]为最终答案$
AC代码

/*
    Author : zzugzx
    Lang : C++
    Blog : blog.csdn.net/qq_43756519
*/
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define SZ(x) (int)x.size()
#define mem(a, b) memset(a, b, sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
//const int mod = 998244353;

const double eps = 1e-6;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const int N = 3e2 + 5;
const ll inf = 0x3f3f3f3f;
const int dir[][2]={{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};

int a[N][N], dp[N][N];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    for (int i = 1; i <= n; i++)
        sort(a[i] + 1, a[i] + 1 + m);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            a[i][j] += a[i][j - 1];
    mem(dp, inf);
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++)
        for (int j = i; j <= min(n, i * m); j++)
            for (int k = i - 1; k <= min(n, min(j, (i - 1) * m)); k++)
                dp[i][j] = min(dp[i][j], dp[i - 1][k] + a[i][j - k] + (j - k) *(j - k));
    cout << dp[n][n];
    return 0;
}