Cod sursa(job #2569069)
Utilizator | Alexis Mihaloianis alexis_mih24 | Data | 4 martie 2020 10:59:47 |
---|---|---|---|
Problema | Grendizer | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
long i,j,k,n,v[100000],p1,p2,s,maxs,s1,s2;
int main()
{
ofstream g("expresie.out");
ifstream f("expresie.in");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
s=0;
for(i=1;i<=n-1;i++)
{ s1=s1+v[i-1];
s2=0;
for(j=i+1;j<=n-1;j++)
{
p1=v[i]*v[i+1];
p2=v[j]*v[j+1];
s=p1+p2;
for(k=j+2;k<=n;k++)
{
if(k!=i && k!=j && k!=i+1 && k!=j+1)
s=s+v[k];
}
s=s+s1+s2;
if(s>maxs)
maxs=s;
s2=s2+v[j];
}
}
g<<maxs;
f.close();
g.close();
return 0;
}