发现处理奇货的代码不需要三重循环也行，为啥呢 下面俩代码都能过

for (int i = 1; i <= m; ++i) {
    int x, y, z;
    cin >> x >> y >> z;
    for (int k = 0; k <= c; ++k) {
        f[c] = max(f[c], f[c - k] + x * k * k + y * k + z);
    }
}

for (int i = 1; i <= m; ++i) {
    int x, y, z;
    cin >> x >> y >> z;
    for (int j = c; ~j; --j) {
        for (int k = 0; k <= j; ++k) {
            f[j] = max(f[j], f[j - k] + x * k * k + y * k + c);
        }
    }
 }