Cod sursa(job #2280176)
Utilizator | Data | 10 noiembrie 2018 12:31:05 | |
---|---|---|---|
Problema | Oo | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#define NMAX 100001
using namespace std;
ifstream in("oo.in");
ofstream out("oo.out");
int n;
int p[NMAX],profit[NMAX+1];
int main()
{
in>>n;
for (int i=1;i<n;++i)
in>>p[i];
p[n+1]=p[1];
p[n+2]=p[2];
for (int i=2;i<=n;++i)
{
profit[i]=max(profit[i-1],p[i]+p[i-1]+profit[i-3]);
}
for (int i=1;i<=n;++i)
cout<<profit[i]<<" ";
out<<profit[n-1];
return 0;
}