結果
問題 | No.711 競技レーティング単調増加 |
ユーザー | hiromi_ayase |
提出日時 | 2018-06-30 00:24:08 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,096 bytes |
コンパイル時間 | 2,391 ms |
コンパイル使用メモリ | 79,396 KB |
実行使用メモリ | 62,208 KB |
最終ジャッジ日時 | 2023-09-13 15:56:15 |
合計ジャッジ時間 | 12,741 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
50,948 KB |
testcase_01 | AC | 68 ms
50,872 KB |
testcase_02 | AC | 68 ms
51,116 KB |
testcase_03 | AC | 70 ms
51,488 KB |
testcase_04 | AC | 71 ms
49,260 KB |
testcase_05 | AC | 73 ms
51,204 KB |
testcase_06 | AC | 73 ms
51,056 KB |
testcase_07 | AC | 71 ms
50,924 KB |
testcase_08 | AC | 71 ms
51,060 KB |
testcase_09 | AC | 71 ms
50,852 KB |
testcase_10 | AC | 73 ms
51,236 KB |
testcase_11 | AC | 72 ms
51,212 KB |
testcase_12 | AC | 70 ms
51,008 KB |
testcase_13 | AC | 69 ms
51,048 KB |
testcase_14 | AC | 69 ms
51,064 KB |
testcase_15 | AC | 70 ms
50,976 KB |
testcase_16 | AC | 72 ms
50,880 KB |
testcase_17 | AC | 72 ms
51,260 KB |
testcase_18 | AC | 286 ms
58,820 KB |
testcase_19 | AC | 277 ms
58,412 KB |
testcase_20 | AC | 288 ms
58,728 KB |
testcase_21 | AC | 284 ms
58,900 KB |
testcase_22 | AC | 281 ms
59,252 KB |
testcase_23 | AC | 277 ms
58,676 KB |
testcase_24 | AC | 288 ms
58,616 KB |
testcase_25 | AC | 274 ms
58,392 KB |
testcase_26 | AC | 293 ms
59,320 KB |
testcase_27 | AC | 277 ms
58,700 KB |
testcase_28 | AC | 248 ms
58,700 KB |
testcase_29 | AC | 259 ms
58,300 KB |
testcase_30 | AC | 292 ms
58,752 KB |
testcase_31 | AC | 318 ms
59,700 KB |
testcase_32 | AC | 314 ms
61,764 KB |
testcase_33 | AC | 309 ms
59,128 KB |
testcase_34 | AC | 305 ms
58,828 KB |
testcase_35 | AC | 320 ms
60,920 KB |
testcase_36 | AC | 235 ms
57,708 KB |
testcase_37 | AC | 300 ms
62,208 KB |
testcase_38 | AC | 280 ms
58,688 KB |
testcase_39 | AC | 228 ms
57,072 KB |
testcase_40 | WA | - |
testcase_41 | AC | 70 ms
50,612 KB |
testcase_42 | AC | 267 ms
56,940 KB |
testcase_43 | AC | 282 ms
58,980 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int[] a = na(n); int[] b = new int[n]; int ptr = 0; for (int i = 0; i < n; i ++) { if (a[i] > i) { b[ptr ++] = a[i] - i; } } b = Arrays.copyOf(b, ptr); System.out.println(n - lis(b)); } public static int lis(int[] in) { int n = in.length; int ret = 0; int[] h = new int[n + 1]; Arrays.fill(h, Integer.MIN_VALUE / 2); for(int i = 0;i < n;i++){ int ind = Arrays.binarySearch(h, 0, ret + 1, in[i] + 1); if(ind < 0){ ind = -ind-2; h[ind+1] = in[i]; if(ind >= ret)ret++; } } return ret; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }