Pagini recente » Cod sursa (job #2416060) | Cod sursa (job #1411299) | Cod sursa (job #273098) | Cod sursa (job #571158) | Cod sursa (job #1851455)
# include <fstream>
# include <algorithm>
# define DIM 100010
using namespace std;
ifstream fin("avioane.in");
ofstream fout("avioane.out");
int v[DIM],p[DIM],n,i;
long long d[DIM],sol;
void dei(int st,int dr){
int mij=(st+dr)/2;
if(dr<st)
return;
for(int i=p[st-1];i<=p[dr+1]&&i<=mij;i++)
if(1LL*v[mij]*(n-mij+1)+1LL*v[i]*(mij-i)>d[mij]){
d[mij]=1LL*v[mij]*(n-mij+1)+1LL*v[i]*(mij-i);
p[mij]=i;
}
dei(st,mij-1);
dei(mij+1,dr);
}
int main () {
fin>>n;
p[0]=1;
p[n+1]=n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
dei(1,n);
for(i=1;i<=n;i++)
sol=max(sol,d[i]);
fout<<sol<<"\n";
return 0;
}