Submission #29528616

---

Source Code Expand

import java.io.*;
import java.util.*;

public class Main {

    static FastScanner sc = new FastScanner();
    static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

    static void solve(){
        int n = sc.nextInt();
        LinkedList<int[]>list = new LinkedList<>();
        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum++;
            int cur = sc.nextInt();
            if(list.isEmpty()){
                list.add(new int[]{cur,1});
            }else{
                if(list.getLast()[0] != cur){
                    list.add(new int[]{cur,1});
                }else{
                    list.getLast()[1]++;
                    if(list.getLast()[1] == cur){
                        list.removeLast();
                        sum -= cur;
                    }
                }
            }
            System.out.println(sum);
        }
        out.flush();
    }


    public static void main(String[] args) {
        int n = 1;
        for(int i = 0;i < n;i++){
            solve();
        }
        out.flush();
    }



    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
}

Submission Info

Judge Result