优先队列~~~

最新推荐文章于 2023-12-15 14:57:14 发布

kidozh

最新推荐文章于 2023-12-15 14:57:14 发布

阅读量308

点赞数

分类专栏：优先队列文章标签：优先队列

本文链接：https://blog.csdn.net/kidozh/article/details/38688031

版权

优先队列专栏收录该内容

1 篇文章 0 订阅

订阅专栏

E - 楼上哪里比楼上的楼上简单了？没看出来！但是我知道我最简单了！

Time Limit:12000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

An array of size n ≤ 10 ⁶ is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
The array is [1 3 -1 -3 5 3 6 7], and k is 3.

Window position	Minimum value	Maximum value
[1 3 -1] -3 5 3 6 7	-1	3
1 [3 -1 -3] 5 3 6 7	-3	3
1 3 [-1 -3 5] 3 6 7	-3	5
1 3 -1 [-3 5 3] 6 7	-3	5
1 3 -1 -3 [5 3 6] 7	3	6
1 3 -1 -3 5 [3 6 7]	3	7

Your task is to determine the maximum and minimum values in the sliding window at each position.

Input

The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.

Output

There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.

Sample Input

8 3
1 3 -1 -3 5 3 6 7

Sample Output

-1 -3 -3 -3 3 3
3 3 5 5 6 7

这个题数据量异常庞大 dp基本没戏那么只能考虑二分或者优先队列这种比较快捷的方法本弱只会这两种简化方式如果有大神还有更好的解决方法求告知求抽脸Orz....

这个题还是用优先队列吧~~~~

#include<cstdio>
using namespace std;
int tot,win;
int a[1000006],q[1000006];
void getmin(){
    int tail=0,head=1;
    for(int i=1;i<=tot;i++){
        while(head<=tail&&a[q[tail]]>=a[i]) tail--;
        q[++tail]=i;
        if(i>=win){
            while(q[head]<i-win+1) head++;//out of time?
            printf("%d ",a[q[head]]);
        }
    }
    printf("\n");
}
void getmax(){
    int tail=0,head=1;
    for(int i=1;i<=tot;i++){
        while(head<=tail&&a[q[tail]]<=a[i]) tail--;
        q[++tail]=i;
        if(i>=win){
            while(q[head]<i-win+1) head++;//out of time?
            printf("%d ",a[q[head]]);
        }
    }
    printf("\n");
}
int main(){
    scanf("%d%d",&tot,&win);
    for(int i=1;i<=tot;i++) scanf("%d",&a[i]);
    getmin();getmax();
    return 0;
}

需要注意的是这里的a是真实的数字而q则是在这里检查是否当玻璃发生移动的时候返回出需要值的位置这里的取大和取小实质上都是一种操作，是通过q数组来调节位置的 so....你肯定懂了~~~

最后要是有大神想出更好的解决方法请告诉我跪求打脸QAQ