1234. 倍数问题
思路:
类似01背包思想状态转移不难推出
贪心策略优化: 由于只选三个数所以每次只需要枚举所有元素中取膜相同的最大的三个元素即可
样例输入:
4 3
1 2 3 4
样例输出:
9
TLE O ( 3 ∗ n ∗ k O(3 * n * k O(3∗n∗k)
代码:
#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e3 + 10;
vector<int> a;
int f[4][N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++ )
{
int x;
cin >> x;
a.push_back(x);
}
memset(f, -0x3f, sizeof f);
f[0][0] = 0;
for(int j = 0; j < a.size(); j ++ )
{
for(int i = 3; i >= 1; i -- )
{
for(int k = 0; k < m; k ++ )
{
f[i][(k + a[j]) % m] = max(f[i][(k + a[j]) % m], f[i - 1][k] + a[j]);
}
}
}
cout << f[3][0] << endl;
return 0;
}
AC O ( 3 ∗ 3 ∗ k 2 ) O(3 * 3 * k ^ 2) O(3∗3∗k2)
代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 1010;
int n, m;
vector<int> a[N];
int f[4][N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i ++ )
{
int x;
scanf("%d", &x);
a[x % m].push_back(x);
}
memset(f, -0x3f, sizeof f);
f[0][0] = 0;
for (int i = 0; i < m; i ++ )
{
sort(a[i].begin(), a[i].end());
reverse(a[i].begin(), a[i].end());
for (int u = 0; u < 3 && u < a[i].size(); u ++ )
{
int x = a[i][u];
for (int j = 3; j >= 1; j -- )
for (int k = 0; k < m; k ++ )
f[j][k] = max(f[j][k], f[j - 1][(k - x % m + m) % m] + x);
}
}
printf("%d\n", f[3][0]);
return 0;
}