結果

問題 No.318 学学学学学
ユーザー yuya178yuya178
提出日時 2017-11-08 07:00:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 503 ms / 2,000 ms
コード長 4,476 bytes
コンパイル時間 2,744 ms
コンパイル使用メモリ 89,208 KB
実行使用メモリ 65,440 KB
最終ジャッジ日時 2024-06-22 18:23:31
合計ジャッジ時間 11,282 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 141 ms
42,368 KB
testcase_01 AC 176 ms
43,760 KB
testcase_02 AC 185 ms
46,960 KB
testcase_03 AC 170 ms
45,824 KB
testcase_04 AC 186 ms
46,696 KB
testcase_05 AC 453 ms
65,440 KB
testcase_06 AC 484 ms
56,400 KB
testcase_07 AC 490 ms
55,844 KB
testcase_08 AC 374 ms
51,844 KB
testcase_09 AC 351 ms
50,184 KB
testcase_10 AC 279 ms
46,924 KB
testcase_11 AC 503 ms
65,400 KB
testcase_12 AC 408 ms
56,448 KB
testcase_13 AC 355 ms
54,504 KB
testcase_14 AC 325 ms
51,436 KB
testcase_15 AC 317 ms
50,220 KB
testcase_16 AC 266 ms
48,596 KB
testcase_17 AC 387 ms
55,820 KB
testcase_18 AC 361 ms
56,144 KB
testcase_19 AC 373 ms
57,252 KB
testcase_20 AC 243 ms
48,316 KB
testcase_21 AC 58 ms
37,236 KB
testcase_22 AC 57 ms
37,356 KB
testcase_23 AC 53 ms
37,356 KB
testcase_24 AC 54 ms
36,992 KB
testcase_25 AC 56 ms
37,388 KB
testcase_26 AC 55 ms
37,056 KB
testcase_27 AC 56 ms
37,104 KB
testcase_28 AC 56 ms
37,260 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    int MOD = 1000000007;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        int n = ni();
        int[] a = new int[n];
        for(int i = 0; i < n; i++){
            a[i] = ni();
        }
        HashMap<Integer, Integer> first = new HashMap<>();
        HashMap<Integer, Integer> last = new HashMap<>();
        for(int i = 0; i < n; i++){
            last.put(a[i],i);
        }
        for(int i = n-1; i >= 0; i--){
            first.put(a[i],i);
        }
        int[] left = new int[n];
        int[] right = new int[n];
        Arrays.fill(left,-1);
        Arrays.fill(right,-1);
        for(int t : first.keySet()){
            left[first.get(t)] = t;
            right[last.get(t)] = t;
        }
        TreeSet<Integer> set = new TreeSet<>();
        for(int i = 0; i < n; i++){
            if(left[i]>=0) set.add(left[i]);
            out.print(set.last() + " ");
            if(right[i]>=0) set.remove(right[i]);
        }

    }
 
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0