제출 #1243463

#제출 시각아이디문제언어결과실행 시간메모리
1243463m5588ohammedVrtić (COCI18_vrtic)C++20
0 / 160
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
int n;
int arr[200001];
int sum=0;
signed main()
{
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    sort(arr,arr+n);
    int ans=0;
    for(int i=0;i<n-1;i++){
        ans=max(arr[i+1]-arr[i],ans);
    }
    for(int i=0;i<n;i++){
        if(i+2<n) ans=max(arr[i+2]-arr[i],ans);
    }
    cout<<ans<<endl;
    return 0;
}
//g++ -std=c++17 template.cpp -o executable.exe
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...