Question

Va rog ajutati-ma si pe mine!

Answer 1

#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("broaste.in");
ofstream fout("broaste.out");
const int NMAX = 1000005;

int N, Max;
int V[NMAX];

int main()
{
    fin >> N;
    for(int i=1; i<=N; i++) fin >> V[i];
    sort(V + 1, V + N + 1);

    Max = V[1] - 1900;
    for(int i=2; i<=N; i++)
        Max = max(V[i] - V[i-1], Max);

    fout << Max - 1 << '\n';
    return 0;
}