結果

問題 No.365 ジェンガソート
ユーザー ぴろずぴろず
提出日時 2016-04-29 22:26:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 212 ms / 2,000 ms
コード長 4,068 bytes
コンパイル時間 2,382 ms
コンパイル使用メモリ 79,516 KB
実行使用メモリ 43,812 KB
最終ジャッジ日時 2024-10-12 01:36:11
合計ジャッジ時間 8,188 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
36,588 KB
testcase_01 AC 52 ms
36,720 KB
testcase_02 AC 51 ms
36,732 KB
testcase_03 AC 51 ms
36,720 KB
testcase_04 AC 53 ms
36,764 KB
testcase_05 AC 52 ms
36,732 KB
testcase_06 AC 52 ms
36,576 KB
testcase_07 AC 53 ms
36,692 KB
testcase_08 AC 51 ms
36,768 KB
testcase_09 AC 51 ms
36,676 KB
testcase_10 AC 53 ms
36,716 KB
testcase_11 AC 51 ms
36,748 KB
testcase_12 AC 50 ms
36,372 KB
testcase_13 AC 52 ms
36,496 KB
testcase_14 AC 51 ms
36,476 KB
testcase_15 AC 53 ms
36,608 KB
testcase_16 AC 179 ms
42,756 KB
testcase_17 AC 177 ms
42,940 KB
testcase_18 AC 83 ms
37,976 KB
testcase_19 AC 151 ms
41,572 KB
testcase_20 AC 90 ms
38,668 KB
testcase_21 AC 126 ms
39,504 KB
testcase_22 AC 181 ms
42,336 KB
testcase_23 AC 143 ms
40,660 KB
testcase_24 AC 179 ms
42,632 KB
testcase_25 AC 118 ms
39,332 KB
testcase_26 AC 161 ms
41,512 KB
testcase_27 AC 207 ms
43,396 KB
testcase_28 AC 168 ms
41,700 KB
testcase_29 AC 199 ms
43,096 KB
testcase_30 AC 166 ms
41,868 KB
testcase_31 AC 125 ms
39,476 KB
testcase_32 AC 122 ms
39,280 KB
testcase_33 AC 206 ms
43,324 KB
testcase_34 AC 113 ms
39,592 KB
testcase_35 AC 177 ms
42,572 KB
testcase_36 AC 114 ms
41,080 KB
testcase_37 AC 115 ms
40,812 KB
testcase_38 AC 212 ms
43,812 KB
testcase_39 AC 113 ms
41,076 KB
testcase_40 AC 133 ms
41,716 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no365;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		Integer[] a = new Integer[n];
		for(int i=0;i<n;i++) {
			a[i] = io.nextInt();
		}
		Integer[] b = Arrays.copyOf(a, n);
		Arrays.sort(b);
		int ind = n - 1;
		for(int i=n-1;i>=0;i--) {
			if (a[i] == b[ind]) {
				ind--;
			}
		}
		System.out.println(ind + 1);
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0