Pagini recente » Cod sursa (job #2902298) | Cod sursa (job #1596189) | Cod sursa (job #2456844) | Cod sursa (job #1257984) | Cod sursa (job #586743)
Cod sursa(job #586743)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("avioane.in");
ofstream g("avioane.out");
int a[100001],v1[100001],v2[100001],n,sm,i,j,x,y,x1,w;
void citire(){
f>>n;
for(i=1;i<=n;++i)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<=n;++i){
v1[i]=(n-i+1)*a[i];
}
for(i=1;i<=n;++i){
x1=0;w=1;
for(j=n;j>=i && w;--j){
x=(n-j+1)*(a[j]-a[i]);
if(x>x1) x1=x;
else w=0;
}
v2[i]=x1;
}
sm=v1[1]+v2[1];
for(i=2;i<=n;++i){
x=v1[i]+v2[i];
if(sm<x) sm=x;
}
}
int main(){
citire();
g<<sm<<'\n';
g.close();
return 0;
}