Cod sursa(job #586756)
| Utilizator | Data | 2 mai 2011 21:09:00 | |
|---|---|---|---|
| Problema | Avioane | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("avioane.in");
ofstream g("avioane.out");
long long a[100001],v1[100001],n,sm,i,j,x,y,x1;
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];
x1=0;
for(j=n;j>=i;--j){
x=(n-j+1)*(a[j]-a[i]);
if(x>x1) x1=x;
}
v1[i]+=x1;
}
sm=v1[1];
for(i=2;i<=n;++i){
if(sm<v1[i]) sm=v1[i];
}
}
int main(){
citire();
g<<sm<<'\n';
g.close();
return 0;
}
