Cod sursa(job #585815)
Utilizator | Florin Chirica elfus | Data | 30 aprilie 2011 12:00:34 |
---|---|---|---|
Problema | Avioane | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 5-9 | Marime | 0.5 kb |
#include<stdio.h>
#include<algorithm>
#define LMAX 100100
int x[LMAX];
using namespace std;
int main()
{
int n,i,j;
long long s,smax=0;
freopen("avioane.in","r",stdin);
freopen("avioane.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&x[i]);
sort(x+1,x+n+1);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
s=x[i]*(j-i)+x[j]*(n-j+1);
if(s>smax)
smax=s;
}
printf("%lld",smax);
return 0;
}