AcWing 1049. 大盗阿福
原题链接
简单
作者:
重生之我是小雪菜
,
2022-02-15 23:16:11
,
所有人可见
,
阅读 113
DP方法一:状态机
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int f[N][2];
int w[N];
int main()
{
int T;
cin >> T;
while (T -- )
{
int n;
cin >> n;
for (int i = 0; i < n; ++ i) cin >> w[i];
f[0][1] = w[0];
f[0][0] = 0;
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];
}
cout << max(f[n - 1][0], f[n - 1][1]) << endl;
}
return 0;
}
DP方法二:01背包
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int f[N];
int w[N];
int main()
{
int T;
cin >> T;
while (T -- )
{
int n;
cin >> n;
for (int i = 0; i < n; ++ i) cin >> w[i];
f[0] = w[0];
f[1] = max(w[0], w[1]);
for (int i = 2; i < n; ++ i)
f[i] = max(f[i - 2] + w[i], f[i - 1]);
cout << f[n - 1] << endl;
}
return 0;
}