Submission #1072551

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <cmath>
#include <string>
#include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <numeric>
#include <array>
#include <float.h>
#include <memory>
#include <functional>
#include <iomanip>
#include <random>
#include <map>

using namespace std;

constexpr auto DIV = 1000000007ull;
using ULL = decltype(0ull);

int main() {
  ULL N, K, output = 0ull;
  cin >> N >> K;
  vector<ULL> table(N - K + 1, 0);
  vector<int> input(N);
  {
    ULL index = 0;
    for (auto&& val : input) {
      cin >> val;
      for (ULL i = (index < K ? 0 : index - K + 1); i < table.size(); ++i) {
        if (i <= index) {
          table[i] += val;
        }
      }
      ++index;
    }
  }
  cout << accumulate(table.begin(), table.end(), 0ull) << endl;

  return 0;
}

Submission Info

Judge Result