import java.util.*; import java.io.*; public class StockSpan{ static void solve(int a[], int n){ int span[] = new int[n]; Stack st = new Stack<>(); st.push(0); for(int i = 1; i 0 && a[i] > a[st.peek()]){ st.pop(); } if(st.size()==0){ span[i] = i+1; } else{ span[i] = i-st.peek(); } st.push(i); } for(int i = 1; i