結果

問題 No.365 ジェンガソート
ユーザー tutuztutuz
提出日時 2018-10-08 20:26:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 209 ms / 2,000 ms
コード長 3,155 bytes
コンパイル時間 2,737 ms
コンパイル使用メモリ 77,888 KB
実行使用メモリ 56,416 KB
最終ジャッジ日時 2024-10-12 15:41:46
合計ジャッジ時間 9,553 ms
ジャッジサーバーID
(参考情報)
judge2 / judge
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,532 KB
testcase_01 AC 52 ms
50,528 KB
testcase_02 AC 50 ms
50,364 KB
testcase_03 AC 50 ms
50,168 KB
testcase_04 AC 50 ms
50,672 KB
testcase_05 AC 51 ms
50,484 KB
testcase_06 AC 50 ms
50,524 KB
testcase_07 AC 50 ms
50,296 KB
testcase_08 AC 49 ms
50,552 KB
testcase_09 AC 51 ms
50,548 KB
testcase_10 AC 51 ms
50,460 KB
testcase_11 AC 51 ms
50,500 KB
testcase_12 AC 51 ms
50,312 KB
testcase_13 AC 50 ms
50,508 KB
testcase_14 AC 49 ms
50,540 KB
testcase_15 AC 50 ms
50,248 KB
testcase_16 AC 181 ms
56,152 KB
testcase_17 AC 167 ms
55,452 KB
testcase_18 AC 98 ms
52,200 KB
testcase_19 AC 203 ms
56,252 KB
testcase_20 AC 136 ms
54,720 KB
testcase_21 AC 114 ms
52,608 KB
testcase_22 AC 176 ms
56,348 KB
testcase_23 AC 143 ms
54,552 KB
testcase_24 AC 177 ms
56,180 KB
testcase_25 AC 121 ms
52,076 KB
testcase_26 AC 171 ms
56,192 KB
testcase_27 AC 189 ms
55,616 KB
testcase_28 AC 176 ms
56,232 KB
testcase_29 AC 192 ms
56,416 KB
testcase_30 AC 176 ms
56,224 KB
testcase_31 AC 132 ms
54,596 KB
testcase_32 AC 132 ms
55,632 KB
testcase_33 AC 195 ms
55,196 KB
testcase_34 AC 100 ms
52,236 KB
testcase_35 AC 183 ms
56,152 KB
testcase_36 AC 195 ms
56,292 KB
testcase_37 AC 200 ms
55,444 KB
testcase_38 AC 209 ms
56,372 KB
testcase_39 AC 205 ms
56,056 KB
testcase_40 AC 203 ms
56,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			int[] a = new int[n+10];
			for (int i = 0; i < n; i++) {
				a[i] = in.nextInt();
			}
			a[n] = n+1;

			int[] dp = new int[n+10];
			int num = n;
			for (int i = n-1; i >= 0; i--) {
				if (a[i] == num) {
					dp[num] = dp[num+1] + 1;
					num--;
				}
			}

			int ans = 0;
			for (int i = 0; i < n+10; i++) {
				ans = Math.max(ans, dp[i]);
			}

			out.println(n - ans);

		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0