算法1
状态机模型
C++ 代码
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 100010, INF = 0x3f3f3f3f;
int f[N][2];
int w[N];
int n;
int main()
{
int t;
scanf("%d", &t);
while (t -- )
{
cin >> n;
for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
f[0][0] = 0, f[0][1] = -INF;
for (int i = 1; i <= n; i ++ )
{
f[i][0] = max(f[i - 1][0], f[i - 1][1]);
f[i][1] = f[i - 1][0] + w[i];
}
int ans = max(f[n][0], f[n][1]);
printf("%d\n", ans);
}
return 0;
}
算法2
背包模型
C++ 代码
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 100010;
int f[N];
int w[N];
int n;
int main()
{
int t;
scanf("%d", &t);
while (t -- )
{
scanf("%d", &n);
for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
f[0] = 0, f[1] = w[1];
for (int i = 1; i <= n; i ++ ) // 没有体积限制,只要枚举物品就好
f[i] = max(f[i - 1], f[i - 2] + w[i]);
printf("%d\n", f[n]);
}
return 0;
}