| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1243463 | m5588ohammed | Vrtić (COCI18_vrtic) | C++20 | 0 ms | 328 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
