优先队列40分,4wa求调

P1440 求m区间内的最小值

@[struct_cym](/user/537458) 代码: ```cpp #include<bits/stdc++.h> using namespace std; const int maxn=2e6+1; int a[maxn]; deque<int>q; int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) scanf("%d",&a[i]); printf("0\n"); for(int i=2;i<=n;i++){ while(!q.empty()&&a[q.back()]>a[i-1]) q.pop_back(); q.push_back(i-1); while(!q.empty()&&q.front()<i-m) q.pop_front(); printf("%d\n",a[q.front()]); } return 0; }
by aochiao @ 2024-05-04 12:27:27


@[struct_cym](/user/537458) 求关注QwQ
by aochiao @ 2024-05-04 12:28:04


|