Submission #14395

#TimeUsernameProblemLanguageResultExecution timeMemory
14395pjsdream정전 (OJUZ10_blackout)C++98
100 / 100
51 ms2256 KiB
#include <stdio.h> #include <algorithm> long long a[150005], ans; int main(){ int n; long long L; scanf("%d %lld", &n, &L); for (int i = 0; i < n; i++) scanf("%lld", &a[i]); std::sort(a, a + n); long long x = a[0] + L, s = a[0] - L; for (int i = 1; i < n; i++){ if(a[i] - L > s) s = a[i] - L; if (s <= x){ ans += (x - s); s = x; } x = a[i] + L; } printf("%lld", ans); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...