POJ2823双端队列

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. 


求滑动区间最大值最小值

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Deque;
import java.util.LinkedList;
import java.util.StringTokenizer;



public class Main {
	
	public static void main(String[] args) {
		new POJ2823().solve() ; 
	}

}

class POJ2823{
	InputReader in = new InputReader(System.in) ;
	PrintWriter out = new PrintWriter(System.out) ;
	final int N = 1000008 ;
	int[] num = new int[N] ;
	int[] min = new int[N] ;
	int[] max = new int[N] ;
	
	void solve(){
		int n = in.nextInt() ; 
		int k = in.nextInt() ;
		for(int i = 1 ; i <= n ; i++) num[i] = in.nextInt() ;
		Deque<Node> q ;
		q = new LinkedList<Node>() ;
		for(int i = 1 ; i <= n ; i++){
			while(! q.isEmpty() && q.getLast().value >= num[i]) q.pollLast() ;
			q.addLast(new Node(num[i] , i)) ;
			while(! q.isEmpty() && i - q.getFirst().idx + 1 > k) q.pollFirst() ;
		    if(i >= k) min[i] = q.getFirst().value ;
		}
		
		q = new LinkedList<Node>() ;
		for(int i = 1 ; i <= n ; i++){
			while(! q.isEmpty() && q.getLast().value <= num[i]) q.pollLast() ;
			q.addLast(new Node(num[i] , i)) ;
			while(! q.isEmpty() && i - q.getFirst().idx + 1 > k) q.pollFirst() ;
			if(i >= k) max[i] = q.getFirst().value ;
		}
		
		out.print(min[k]) ;
		for(int i = k+1 ; i <= n ; i++) out.print(" " + min[i]) ;
		out.println() ;
		out.print(max[k]) ;
		for(int i = k+1 ; i <= n ; i++) out.print(" " + max[i]) ;
		out.println() ;
		out.flush() ;
	}
	
	class Node{
		int value ;
		int idx ;
		Node(int value , int idx){
			this.value = value ;
			this.idx = idx ;
		}
		@Override
		public String toString() {
			return "Node [value=" + value + ", idx=" + idx + "]";
		}
		
	}
	
}


class InputReader {  
    public BufferedReader reader;  
    public StringTokenizer tokenizer;  
  
    public InputReader(InputStream stream) {  
        reader = new BufferedReader(new InputStreamReader(stream), 32768);  
        tokenizer = new StringTokenizer("");  
    }  
  
    private void eat(String s) {  
        tokenizer = new StringTokenizer(s);  
    }  
  
    public String nextLine() {  
        try {  
            return reader.readLine();  
        } catch (Exception e) {  
            return null;  
        }  
    }  
  
    public boolean hasNext() {  
        while (!tokenizer.hasMoreTokens()) {  
            String s = nextLine();  
            if (s == null)  
                return false;  
            eat(s);  
        }  
        return true;  
    }  
  
    public String next() {  
        hasNext();  
        return tokenizer.nextToken();  
    }  
  
    public int nextInt() {  
        return Integer.parseInt(next());  
    }  
  
    public long nextLong() {  
        return Long.parseLong(next());  
    }  
  
    public double nextDouble() {  
        return Double.parseDouble(next());  
    }  
  
    public BigInteger nextBigInteger() {  
        return new BigInteger(next());  
    }  
  
}  



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013491262/article/details/52776953
个人分类: Java足迹
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭