結果
問題 | No.390 最長の数列 |
ユーザー |
![]() |
提出日時 | 2017-11-02 20:54:55 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 357 ms / 5,000 ms |
コード長 | 2,237 bytes |
コンパイル時間 | 2,246 ms |
コンパイル使用メモリ | 79,268 KB |
実行使用メモリ | 50,616 KB |
最終ジャッジ日時 | 2024-11-22 13:48:19 |
合計ジャッジ時間 | 6,376 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 15 |
ソースコード
import java.io.BufferedReader; import java.io.Closeable; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.LinkedList; import java.util.Scanner; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { Scanner sc = new Scanner(System.in); final int N = sc.nextInt(); int[] array = sc.nextIntArray(N); Arrays.sort(array); final int max = Arrays.stream(array).max().getAsInt(); int[] DP = new int[max + 1]; for(int i = 0; i < N; i++){ DP[array[i]] = 1; } for(int i = 0; i < N; i++){ final int value = array[i]; for(int j = value * 2; j <= max; j += value){ DP[j] = Math.max(DP[j], DP[value] + 1); } } int answer = 0; for(int i = 0; i < N; i++){ answer = Math.max(answer, DP[array[i]]); } //System.out.println(Arrays.toString(DP)); //System.out.println(Arrays.toString(array)); System.out.println(answer); } public static class Scanner implements Closeable { private BufferedReader br; private StringTokenizer tok; public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is)); } private void getLine() throws IOException { while (!hasNext()) { tok = new StringTokenizer(br.readLine()); } } private boolean hasNext() { return tok != null && tok.hasMoreTokens(); } public String next() throws IOException { getLine(); return tok.nextToken(); } public int nextInt() throws IOException { return Integer.parseInt(next()); } public long nextLong() throws IOException { return Long.parseLong(next()); } public double nextDouble() throws IOException { return Double.parseDouble(next()); } public int[] nextIntArray(int n) throws IOException { final int[] ret = new int[n]; for (int i = 0; i < n; i++) { ret[i] = this.nextInt(); } return ret; } public long[] nextLongArray(int n) throws IOException { final long[] ret = new long[n]; for (int i = 0; i < n; i++) { ret[i] = this.nextLong(); } return ret; } public void close() throws IOException { br.close(); } } }