2022/7/2
作者:
史一帆
,
2022-07-04 17:42:14
,
所有人可见
,
阅读 157
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 25;
int n;
int s[N], w[N], e[N];
int main()
{
s[1] = w[1] = e[1] = 1;
cin >> n;
for (int i = 2; i <= n; i ++ ){
s[i] = s[i - 1] + w[i - 1] + e[i - 1];
w[i] = s[i - 1] + w[i - 1];
e[i] = s[i - 1] + e[i - 1];
}
cout << s[n] + w[n] + e[n] << endl;
return 0;
}
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 15;
int n, m;
int f[N][N], fac[N];
int main()
{
cin >> n >> m;
f[0][0] = fac[0] = 1;
for (int i = 1; i <= m; i ++ ) fac[i] = fac[i - 1] * i;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= min(m, i); j ++ )
f[i][j] = f[i - 1][j - 1] + f[i - 1][j] * j;
cout << f[n][m] * fac[m] << endl;
return 0;
}
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10010;
int n;
int f[N][2], w[N];
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> w[i];
f[1][1] = w[1], f[2][1] = w[2];
for (int i = 3; i <= n; i ++ ){
f[i][0] = min(f[i - 1][1], f[i - 2][1]);
f[i][1] = min(f[i - 1][0], f[i - 1][1]) + w[i];
}
cout << min(f[n][0], f[n][1]) << endl;
return 0;
}