Cod sursa(job #1979128)

Utilizator DavidLDavid Lauran DavidL Data 9 mai 2017 19:08:34
Problema Oo Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.62 kb
#include <fstream>
#define MAX 100001
using namespace std;
ifstream fi("oo.in");
ofstream fo("oo.out");

int dp[MAX],x[MAX],n,i,rez,maxim,j;
int main()
{
    fi>>n;
    for (i=1; i<=n; i++)
        fi>>x[i];
    dp[1]=x[n-1]+x[n];
    dp[2]=x[n]+x[1];
    for (i=3; i<=7; i++)
        dp[i]=x[i-2]+x[i-1];
    for (i=8; i<=n; i++)
    {
        ///dp[i-3]...dp[i-1]
        maxim=0;
        for (j=i-7; j<=i-2; j++)
            maxim=max(maxim,dp[j]);
        dp[i]=maxim+x[i-2]+x[i-1];
    }
    for (i=1; i<=n; i++)
        rez=max(rez,dp[i]);
    fo<<rez;
    fi.close();
    fo.close();
    return 0;
}