Cod sursa(job #688855)
Utilizator | FMI - Donisan George donydony2009 | Data | 23 februarie 2012 21:53:47 |
---|---|---|---|
Problema | Avioane | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
using namespace std;
#define NMAX 100006
inline long long MAX(int a,int b)
{
return a>b?a:b;
}
long long int v[NMAX],v1[NMAX];
int main(void)
{
int n,i,sol=0,nr=0,rez=0,max=-1,j;
ifstream f("avioane.in");
ofstream g("avioane.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
{
for(j=i;j>=1;j--)
max=MAX((i-j+1)*v[j],max);
v1[i]=max;
rez=MAX((n-i)*v[i+1]+v1[i],rez);
}
g<<rez;
}