結果
問題 | No.390 最長の数列 |
ユーザー | nCk_cv |
提出日時 | 2016-07-13 18:06:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 778 ms / 5,000 ms |
コード長 | 3,603 bytes |
コンパイル時間 | 2,140 ms |
コンパイル使用メモリ | 78,056 KB |
実行使用メモリ | 44,960 KB |
最終ジャッジ日時 | 2024-10-02 10:55:03 |
合計ジャッジ時間 | 6,887 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
42,072 KB |
testcase_01 | AC | 94 ms
41,828 KB |
testcase_02 | AC | 94 ms
42,128 KB |
testcase_03 | AC | 86 ms
41,880 KB |
testcase_04 | AC | 99 ms
42,028 KB |
testcase_05 | AC | 195 ms
43,980 KB |
testcase_06 | AC | 778 ms
42,968 KB |
testcase_07 | AC | 78 ms
41,364 KB |
testcase_08 | AC | 52 ms
40,664 KB |
testcase_09 | AC | 75 ms
41,488 KB |
testcase_10 | AC | 311 ms
44,768 KB |
testcase_11 | AC | 279 ms
44,296 KB |
testcase_12 | AC | 314 ms
44,960 KB |
testcase_13 | AC | 293 ms
43,136 KB |
testcase_14 | AC | 679 ms
44,724 KB |
testcase_15 | AC | 51 ms
40,736 KB |
testcase_16 | AC | 52 ms
40,468 KB |
testcase_17 | AC | 70 ms
41,264 KB |
testcase_18 | AC | 79 ms
41,776 KB |
ソースコード
import java.io.*; import java.math.*; import java.util.*; import java.util.Map.Entry; class Main { static int[] vy = {1,0,-1,0}; static int[] vx = {0,1,0,-1}; static long mod = 1000000007; static HashMap<String,Boolean> map = new HashMap<String,Boolean>(); public static void main(String[] args) { FastScanner sc = new FastScanner(); //Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] x = new int[N]; for(int i = 0; i < N; i++) { x[i] = sc.nextInt(); } Arrays.sort(x); int[] dp = new int[1000001]; for(int i = 0; i < N; i++) { if(dp[x[i]] == 0) dp[x[i]]++; for(int j = 2; ; j++) { if(x[i] * j >= dp.length) break; int id = Arrays.binarySearch(x, x[i] * j); if(id >= 0) { dp[x[i] * j] = Math.max(dp[x[i]]+1,dp[x[i] * j]); } } } int max = 0; for(int i = 0; i < x.length; i++) { max = Math.max(max, dp[x[i]]); } System.out.println(max); } static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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 void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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 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() { if (!hasNext()) throw new NoSuchElementException(); int 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(); } } } }