Pagini recente » Cod sursa (job #950306) | Cod sursa (job #407722) | Cod sursa (job #1927444) | Cod sursa (job #2104730) | Cod sursa (job #2569010)
#include <iostream>
#include <fstream>
using namespace std;
long i,j,k,n,v[100000],p1,p2,s,maxs;
int main()
{
ofstream g("expresie.out");
ifstream f("expresie.in");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
{
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=1;k<=n;k++)
{
if(k!=i && k!=j && k!=i+1 && k!=j+1)
s=s+v[k];
}
if(s>maxs)
maxs=s;
}
}
g<<maxs;
f.close();
g.close();
return 0;
}