結果
問題 | No.390 最長の数列 |
ユーザー | 37zigen |
提出日時 | 2016-07-07 21:32:42 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,168 bytes |
コンパイル時間 | 2,741 ms |
コンパイル使用メモリ | 79,400 KB |
実行使用メモリ | 60,580 KB |
最終ジャッジ日時 | 2024-10-12 23:22:19 |
合計ジャッジ時間 | 10,169 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,904 KB |
testcase_01 | AC | 52 ms
36,920 KB |
testcase_02 | AC | 53 ms
36,828 KB |
testcase_03 | AC | 53 ms
37,028 KB |
testcase_04 | AC | 53 ms
36,972 KB |
testcase_05 | TLE | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
ソースコード
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; public class Main { static void solver() { int n = ni(); int[] x = new int[n]; for (int i = 0; i < n; i++) { x[i] = ni(); } Arrays.sort(x); int[] dp = new int[n]; Arrays.fill(dp, 1); int ans=0; for (int i = 1; i < n; i++) { int max = 0; for (int j = 0; j < i; j++) { if (x[i] % x[j] == 0) { max = Math.max(max, dp[j]); } } dp[i] += max; ans=Math.max(ans, dp[i]); } out.println(ans); } static InputStream is; static PrintWriter out; static String INPUT = ""; public static void main(String[] args) throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solver(); out.flush(); } static long nl() { try { long num = 0; boolean minus = false; while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-')); if(num == '-'){ num = 0; minus = true; }else{ num -= '0'; } while(true){ int b = is.read(); if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } } } catch (IOException e) { } return -1; } static char nc() { try { int b = skip(); if(b == -1)return 0; return (char)b; } catch (IOException e) { } return 0; } static double nd() { try { return Double.parseDouble(ns()); }catch(Exception e) { } return 0; } static String ns() { try{ int b = skip(); StringBuilder sb = new StringBuilder(); if(b == -1)return ""; sb.append((char)b); while(true){ b = is.read(); if(b == -1)return sb.toString(); if(b <= ' ')return sb.toString(); sb.append((char)b); } } catch (IOException e) { } return ""; } public static char[] ns(int n) { char[] buf = new char[n]; try{ int b = skip(), p = 0; if(b == -1)return null; buf[p++] = (char)b; while(p < n){ b = is.read(); if(b == -1 || b <= ' ')break; buf[p++] = (char)b; } return Arrays.copyOf(buf, p); } catch (IOException e) { } return null; } public static byte[] nse(int n) { byte[] buf = new byte[n]; try{ int b = skip(); if(b == -1)return null; is.read(buf); return buf; } catch (IOException e) { } return null; } static int skip() throws IOException { int b; while((b = is.read()) != -1 && !(b >= 33 && b <= 126)); return b; } static boolean eof() { try { is.mark(1000); int b = skip(); is.reset(); return b == -1; } catch (IOException e) { return true; } } static int ni() { try { int num = 0; boolean minus = false; while((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-')); if(num == '-'){ num = 0; minus = true; }else{ num -= '0'; } while(true){ int b = is.read(); if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } } } catch (IOException e) { } return -1; } }