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 <cmath> #include <vector> #include <queue> #include <algorithm> #include <cstring> #include <fstream> #include <map> #include <set> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<ll> v(n); set<ll> s; for(int i = 0; i < n; i++) { cin >> v[i]; } for(int i = 0; i < n - 1; i++) { s.insert(v[i]); } ll result = 1e18; for(int i = n - 1; i > 0; i--) { set<ll>::iterator it = s.lower_bound(v[i] + 1); if(it != s.end()) { result = min(result, *it - v[i]); } s.erase(s.lower_bound(v[i - 1])); } cout << result << 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)
