zoukankan      html  css  js  c++  java
  • 单调队列 hdu2823

    Sliding Window
    Time Limit: 12000MS   Memory Limit: 65536K
    Total Submissions: 48608   Accepted: 14047
    Case Time Limit: 5000MS

    Description

    An array of size n ≤ 106 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 positionMinimum valueMaximum 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
     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <queue>
     4 #include <algorithm>
     5 using namespace std;
     6 
     7 int a[1000005],q[1000005],p[1000005],mi[1000005],ma[1000005];
     8 int n,k;
     9 
    10 void get_min()
    11 {
    12     int i,j;
    13     int head=1,tail=0;
    14     for(i=0;i<k-1;i++)
    15     {
    16         while(head<=tail && q[tail]>=a[i])
    17             tail--;
    18         q[++tail]=a[i];
    19         p[tail]=i;
    20     }
    21 
    22     for(;i<n;i++)
    23     {
    24         while(head<=tail && q[tail]>=a[i])
    25             tail--;
    26         q[++tail]=a[i];
    27         p[tail]=i;
    28         while(p[head]<i-k+1)
    29         {
    30             head++;
    31         }
    32         mi[i-k+1]=q[head];
    33     }
    34 }
    35 
    36 void get_max()
    37 {
    38     int i,j;
    39     int head=1,tail=0;
    40     for(i=0;i<k-1;i++)
    41     {
    42         while(head<=tail && q[tail]<=a[i])
    43             tail--;
    44         q[++tail]=a[i];
    45         p[tail]=i;
    46     }
    47     for(;i<n;i++)
    48     {
    49         while(head<=tail && q[tail]<=a[i])
    50             tail--;
    51         q[++tail]=a[i];
    52         p[tail]=i;
    53         while(p[head]<i-k+1)
    54             head++;
    55         ma[i-k+1]=q[head];
    56     }
    57 }
    58 
    59 int main()
    60 {
    61     int i,j;
    62     scanf("%d %d",&n,&k);
    63     for(i=0;i<n;i++)
    64     {
    65         scanf("%d",&a[i]);
    66     }
    67     get_max();
    68     get_min();
    69     for(i=0;i<n-k;i++)
    70     {
    71         printf("%d ",mi[i]);
    72     }
    73     printf("%d
    ",mi[n-k]);
    74     for(i=0;i<n-k;i++)
    75     {
    76         printf("%d ",ma[i]);
    77     }
    78     printf("%d
    ",ma[n-k]);
    79     return 0;
    80 }
    View Code
  • 相关阅读:
    禁止chrome浏览器自动更新检查
    第 3 章 容器
    在CentOS安装配置Nginx基于Docker容器方式
    CentOS各版本系统ISO镜像下载地址
    CentOS6虚拟机安装部署ActiveMQ 5.14
    Elasticsearch 实战与原理解析
    Elasticsearch 实战与原理解析
    Elasticsearch 实战与原理解析
    Elasticsearch源码解析与优化实战:附录 A 重大版本变化
    jmeter(一)安装与配置,ant和jenkins接口测试自动化
  • 原文地址:https://www.cnblogs.com/cyd308/p/4817598.html
Copyright © 2011-2022 走看看