Mai intai trebuie sa te autentifici.
Cod sursa(job #1618491)
Utilizator | Data | 27 februarie 2016 20:48:57 | |
---|---|---|---|
Problema | Rj | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
#define L 200005
using namespace std;
ifstream fin("strabunica.in");
ofstream fout("strabunica.out");
unsigned int n, v[L];
unsigned long long best, comp, mx, nr, mn;
int main()
{
fin >> n;
for (unsigned int i = 1; i <= n; i++){
fin >> v[i];
if (v[i] > mx) mx = v[i];
}
mn = v[1];
best = v[1];
nr = 1;
for (unsigned int i = 2; i <= n; i++){
if (v[i] < mn) mn = v[i];
comp = mn * (nr + 1);
if (v[i] >= comp){
mn = v[i];
nr = 1;
}
else{
nr++;
if (nr * mn > best) best = nr * mn;
}
}
fout << max(mx, best);
return 0;
}