test/aoj/DSL/DSL_3_D.test.cpp

View this file on GitHub
Last update: 2023-11-11 17:58:53+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/problems/DSL_3_D

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_3_D"

#include "../../../template/template.hpp"

#include "../../../data-structure/slide-min.hpp"

int main(){
  int n,k;
  cin >> n >> k;
  vi a(n);
  rep(i, n) cin >> a[i];
  const auto res = slide_min(a, k);
  rep(i, n-k+1) cout << res[i] << " \n"[i == n - k];
}

#line 1 "test/aoj/DSL/DSL_3_D.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/problems/DSL_3_D"

#line 1 "template/template.hpp"
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#include <cstring>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
#line 4 "test/aoj/DSL/DSL_3_D.test.cpp"

#line 1 "data-structure/slide-min.hpp"
template <class T>
vector<T> slide_min(const vector<T> &a, int k){
  int n = (int)a.size();
  deque<T> que;
  vector<T> res(n);
  for(int i = 0; i < n + k - 1; i++){
    while(!que.empty() && i < n && a[que.back()] >= a[i]){
      que.pop_back();
    }
    que.push_back(i);
    if(i - k + 1 >= 0){
      res[i - k + 1] = a[que.front()];
      if(que.front() == i - k + 1) que.pop_front();
    }
  }
  return res;
}
#line 6 "test/aoj/DSL/DSL_3_D.test.cpp"

int main(){
  int n,k;
  cin >> n >> k;
  vi a(n);
  rep(i, n) cin >> a[i];
  const auto res = slide_min(a, k);
  rep(i, n-k+1) cout << res[i] << " \n"[i == n - k];
}