Cod sursa(job #697371)
Utilizator | Ilies Norbert noru | Data | 29 februarie 2012 08:27:12 |
---|---|---|---|
Problema | Oo | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
int a[100001],b[100001];
int max(int a, int b)
{
if (a>b) return a;
return b;
}
int main()
{
int n,i;
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
if (n==2)
{
g<<a[1]+a[2];return 0;}
a[n+1]=a[1];
int s=0;
b[2]=a[1]+a[2];
for (i=3;i<=n-1;i++){
b[i]=max(b[i-1],b[i-3]+a[i-1]+a[i]);
s=max(b[i],s);
}
g<<s;
}