Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <queue> #include <algorithm> #include <vector> #include <algorithm> #include <set> #include <cstring> #include <map> using namespace std; typedef long long ll; int n; ll a[200050]; int main(){ ios_base::sync_with_stdio(false); cin >> n; for(int i = 0; i < n; i++) { cin >> a[i]; } set<ll> st; for(int i = 0; i < n - 1; i++) { st.insert(a[i]); } ll ans = 1e18; for(int i = n - 1; i > 0; i--) { set<ll>::iterator it = st.lower_bound(a[i]); if(it != st.end()) { ans = min(ans, *it - a[i]); } st.erase(st.lower_bound(a[i - 1])); } cout << ans << endl; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
