Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15229 Accepted: 5550DescriptionYou are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, determine the most frequent value among the integers ai , ... , aj.InputThe input consists of se...
http://en.wikipedia.org/wiki/All_nearest_smaller_values.这是问题的所在地这是我的代码,但实现它有些麻烦：import java.util.*; public class stack{public static void main(String[]args){int x[]=new int[]{ 0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15 };Stack<Integer> st=new Stack<Integer>();for (int a:x){while (!st.empty() && st.pop()>=a){System.out.println( st.pop());if (st.empty()){break;}else...