Pagini recente » Cod sursa (job #599883) | Cod sursa (job #2784515) | Cod sursa (job #458374) | Cod sursa (job #2226707) | Cod sursa (job #3147858)
#include <fstream>
using namespace std;
ifstream cin("oo.in");
ofstream cout("oo.out");
const int NMAX = 1e5;
int n;
int a[NMAX + 1];
int dp[NMAX + 1][2];
int main()
{
cin >> n;
cout << n << '\n';
cin.get();
for(int i = 1; i <= n; i++)
{
int x;
cin >> x;
cout << x << ' ';
a[i] = x;
}
cout << '\n';
for(int i = 1; i <= n; i++)
cout << a[i] << ' ';
cout << '\n';
for(int i = 2; i <= n; i++)
{
dp[i][0] = max(dp[i - 1][1], dp[i - 1][0]);
dp[i][1] = dp[i - 2][0] + a[i] + a[i - 1];
cout << i << ' ' << dp[i][0] << ' ' << dp[i][1] << '\n';
}
cout << max(dp[n][0], dp[n][1]);
return 0;
}