Comments

• 
  

  0

  

  LãoTam  commented on Oct. 28, 2021, 12:48 p.m.

  [user:^_^]Tham Khảo

  #include<bits/stdc++.h>
  #include<iostream>
  using namespace std;
  int main() {
      int n,k,x;
      list<int> L; //luu vi tri theo gia tri giam dan dang xet
      cin>>n>>k;
      vector<int> a(n+5);
      for(int i=1; i<=n; i++)
          cin>>a[i];
      for(int i=1; i<k; i++) {
          while(L.size()>0 && a[L.back()]<a[i]) L.pop_back();
          L.push_back(i);
      }
      for(int i=k; i<=n; i++) {
          while(L.size()>0 && a[L.back()]<a[i]) L.pop_back();
          L.push_back(i);
          while(i-L.front()>=k)
              L.pop_front();
          cout<<a[L.front()]<<" ";
      }
  }

• 
  

  3

  

  TICHPX  commented on Sept. 17, 2020, 10:11 a.m. ← edited →

  #Python dùng PriorityQueue mà bị TLE
  from queue import PriorityQueue
  class elem:
      def __init__(self,v=0,g=0): self.vitri,self.giatri = v,g
      def __lt__(self, other): return self.giatri>other.giatri
  
  if __name__ == '__main__':
      Q=PriorityQueue()
      n,k=map(int,input().split())
      a=list(map(int,input().split()))
      for i,x in enumerate(a):
          Q.put(elem(i,x))
          if i>=k-1 :
              while i-Q.queue[0].vitri>=k: Q.get()
              print(Q.queue[0].giatri,end = ' ')

• 
  

  1

  

  TICHPX  commented on June 15, 2020, 8:34 a.m.

  Có vẻ bài này test yếu, ta có nâng cấp lên \(n = 10^6\) không nhỉ? Duyệt 2 vòng lặp mà cũng AC

• 
  

  1

  

  Giang_CNTT3_K60  commented on June 15, 2020, 11:27 a.m.

  hợp lý thầy ạ :))