結果

問題 No.365 ジェンガソート
ユーザー yuya178yuya178
提出日時 2017-11-19 22:22:10
言語 Java
(openjdk 23)
結果
AC  
実行時間 86 ms / 2,000 ms
コード長 3,955 bytes
コンパイル時間 2,408 ms
コンパイル使用メモリ 82,536 KB
実行使用メモリ 38,640 KB
最終ジャッジ日時 2024-11-26 00:40:32
合計ジャッジ時間 6,461 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
36,772 KB
testcase_01 AC 48 ms
36,788 KB
testcase_02 AC 47 ms
36,836 KB
testcase_03 AC 51 ms
36,700 KB
testcase_04 AC 50 ms
36,700 KB
testcase_05 AC 50 ms
36,700 KB
testcase_06 AC 47 ms
36,676 KB
testcase_07 AC 47 ms
36,760 KB
testcase_08 AC 47 ms
36,744 KB
testcase_09 AC 48 ms
36,580 KB
testcase_10 AC 47 ms
37,016 KB
testcase_11 AC 49 ms
36,904 KB
testcase_12 AC 48 ms
36,712 KB
testcase_13 AC 47 ms
36,964 KB
testcase_14 AC 48 ms
36,736 KB
testcase_15 AC 47 ms
37,040 KB
testcase_16 AC 71 ms
38,112 KB
testcase_17 AC 84 ms
38,552 KB
testcase_18 AC 51 ms
37,032 KB
testcase_19 AC 83 ms
38,356 KB
testcase_20 AC 62 ms
37,084 KB
testcase_21 AC 59 ms
36,696 KB
testcase_22 AC 80 ms
38,180 KB
testcase_23 AC 73 ms
37,472 KB
testcase_24 AC 79 ms
38,224 KB
testcase_25 AC 57 ms
36,580 KB
testcase_26 AC 77 ms
37,740 KB
testcase_27 AC 83 ms
38,640 KB
testcase_28 AC 75 ms
37,640 KB
testcase_29 AC 81 ms
38,280 KB
testcase_30 AC 77 ms
37,980 KB
testcase_31 AC 60 ms
37,044 KB
testcase_32 AC 58 ms
36,440 KB
testcase_33 AC 83 ms
38,472 KB
testcase_34 AC 54 ms
36,512 KB
testcase_35 AC 79 ms
38,096 KB
testcase_36 AC 81 ms
38,368 KB
testcase_37 AC 86 ms
38,500 KB
testcase_38 AC 84 ms
38,384 KB
testcase_39 AC 83 ms
38,464 KB
testcase_40 AC 82 ms
38,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

    long MOD = 1_000_000_007;
    int inf = 10000000;
    void solve()
    {
        int n = ni();
        int[] a = new int[n];
        int ans = 0;
        for(int i = 0; i < n; i++){
            a[i]  = ni();
        }
        int x = n;
        for(int i = n-1; i >= 0; i--){
            if(a[i]==x){
                ans++;
                x--;
            }
        }
        out.println(Math.min(n,n-ans));

    }
   
    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