pku2823_Sliding Window

一开始用线段树写的，超时，后来看了看大牛的双端队列版的，勉强过了，好艰辛啊。不过通过这题了解了双端队列，还是有很大收获的。

线段树版（超时版）

/*
 * File:   main.cpp
 * Author: Administrator
 *
 * Created on 2010年1月24日, 下午2:03
 */

#include <stdlib.h>
#include<iostream>
using namespace std;
#define N 1000006
int a_max[N], a_min[N];

struct node {
    int l, r;
    int _min, _max;
} Tree[N * 3];
int A[N];

int Max(int a, int b) {
    if (a >= b)
        return a;
    else
        return b;
}

int Min(int a, int b) {
    if (a <= b)
        return a;
    else
        return b;
}

void Build_Tree(int l, int r, int k) {
    Tree[k].l = l;
    Tree[k].r = r;
    if (l == r) {
        Tree[k]._max = A[l];
        Tree[k]._min = A[l];
        return;
    }
    int mid = (l + r) / 2;
    Build_Tree(l, mid, 2 * k);
    Build_Tree(mid + 1, r, 2 * k + 1);
    Tree[k]._max = Max(Tree[2 * k]._max, Tree[2 * k + 1]._max);
    Tree[k]._min = Min(Tree[2 * k]._min, Tree[2 * k + 1]._min);
}

int Find_Max(int l, int r, int k) {
    if (Tree[k].l == l && Tree[k].r == r) {
        return Tree[k]._max;
    }
    int mid = (Tree[k].l + Tree[k].r) / 2;
    if (r <= mid)return Find_Max(l, r, 2 * k);
    else if (l > mid)return Find_Max(l, r, 2 * k + 1);
    else {
        int a = Find_Max(l, mid, 2 * k);
        int b = Find_Max(mid + 1, r, 2 * k + 1);
        return Max(a, b);
    }
}

int Find_Min(int l, int r, int k) {
    if (Tree[k].l == l && Tree[k].r == r) {
        return Tree[k]._min;
    }
    int mid = (Tree[k].l + Tree[k].r) / 2;
    if (r <= mid)return Find_Min(l, r, 2 * k);
    else if (l > mid)return Find_Min(l, r, 2 * k + 1);
    else {
        int a = Find_Min(l, mid, 2 * k);
        int b = Find_Min(mid + 1, r, 2 * k + 1);
        return Min(a, b);
    }
}

/*
 *
 */
int main(int argc, char** argv) {

    int n, m, i, j;
    //while (scanf("%d%d", &n, &m) != EOF) {
        scanf("%d%d", &n, &m);
        for (i = 1; i <= n; i++) {
            scanf("%d", &A[i]);
        }
        Build_Tree(1, n, 1);
        m -= 1;
        for (i = 1; i <= n - m; i++) {
            a_min[i] = Find_Min(i, i + m, 1);
        }
        for (i = 1; i <= n - m; i++) {
            a_max[i] = Find_Max(i, i + m, 1);
        }
        for (i = 1; i <= n - m; i++) {
            cout << a_min[i] << " ";
            if(i==n-m)
            {
                cout<<endl;
            }
        }
        for (i = 1; i <= n - m; i++) {
            cout << a_max[i] << " ";
            if(i==n-m)
            {
                cout<<endl;
            }
        }
    //}
    return (EXIT_SUCCESS);
}

双端队列版

/*
 * File:   main.cpp
 * Author: Administrator
 *
 * Created on 2010年1月25日, 下午2:11
 */

#include <stdlib.h>
#include<stdio.h>
#include <iostream>
#include <deque>
using namespace std;
#define N 1000005

struct Node {
    int key, num;
} node;
int a[N], max_a[N], min_a[N], k, n;
deque<struct Node>max_q;
deque<struct Node>min_q;

void Max_F(int pos) {
    if (!max_q.empty()) {
        if (pos > k - 1 && (max_q.front().num < pos - k + 1))max_q.pop_front();
        while (!max_q.empty() && max_q.back().key < a[pos])max_q.pop_back();
        max_q.push_back(node);
    } else {
        max_q.push_back(node);
    }
    if (pos >= k - 1)max_a[pos - k + 1] = max_q.front().key;

}

void Min_F(int pos) {
    if (!min_q.empty()) {
        if (pos > k - 1 && (min_q.front().num < pos - (k - 1)))min_q.pop_front();
        while (!min_q.empty() && min_q.back().key >= a[pos])min_q.pop_back();
        min_q.push_back(node);
    } else {
        min_q.push_back(node);
    }
    if (pos >= k - 1)min_a[pos - (k - 1)] = min_q.front().key;
}

/*
 *
 */
int main(int argc, char** argv) {

    int i, j;
    while (scanf("%d%d", &n, &k) != EOF) {
        // scanf("%d%d", &n, &k);
        for (i = 0; i < n; i++) {
            //cin >> a[i];
            scanf("%d", &a[i]);
            node.key = a[i];
            node.num = i;
            Max_F(i);
            Min_F(i);
        }
        for (i = 0; i < n - k; i++) {
            cout << min_a[i] << " ";
        }
        cout << min_a[n - k] << endl;
        for (i = 0; i < n - k; i++) {
            cout << max_a[i] << " ";
        }
        cout << max_a[n - k] << endl;
    }
    return (EXIT_SUCCESS);
}