Submission #3247519

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
int main() {
  long long N, K, mmin = 3000000000;
  long long x[1000000];

  cin >> N >> K;

  for (int i = 0; i < N; i++) cin >> x[i];

  for (int i = 0; i < N - K + 1; i++) {
    long long l = abs(x[i]) + abs(x[i+K-1] - x[i]);
    long long r = abs(x[i+K-1]) + abs(x[i]- x[i+K-1]);
    long long m = min(l, r);
    mmin = min(m, mmin);
  }

  cout << mmin << endl;

  return 0;
}

Submission Info

Judge Result