Submission #4025560

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, K;
  cin >> N >> K;
  vector<long> X(N);
  long ans = 0;
  for (int i = 0; i < N; i++) {
    cin >> X[i];
    ans += abs(X[i]);
  }
  int l = 0, r = K-1;
  while (r < N) {
    long tmp1 = abs(X[l]) + abs(X[r] - X[l]);
    long tmp2 = abs(X[r]) + abs(X[l] - X[r]);
    ans = min({ans, tmp1, tmp2});
    l++; r++;
  }
  cout << ans << endl;
}

Submission Info

Judge Result