結果

問題 No.390 最長の数列
ユーザー uwiuwi
提出日時 2016-07-09 00:59:23
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,263 bytes
コンパイル時間 4,296 ms
コンパイル使用メモリ 81,888 KB
実行使用メモリ 44,052 KB
最終ジャッジ日時 2024-04-21 09:04:04
合計ジャッジ時間 7,406 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 99 ms
42,744 KB
testcase_01 AC 94 ms
42,916 KB
testcase_02 AC 105 ms
42,508 KB
testcase_03 AC 96 ms
42,492 KB
testcase_04 AC 99 ms
42,872 KB
testcase_05 AC 121 ms
44,052 KB
testcase_06 AC 171 ms
43,732 KB
testcase_07 AC 94 ms
42,616 KB
testcase_08 AC 89 ms
42,632 KB
testcase_09 AC 90 ms
42,528 KB
testcase_10 AC 129 ms
43,940 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 134 ms
43,512 KB
testcase_14 WA -
testcase_15 AC 89 ms
42,664 KB
testcase_16 AC 90 ms
42,772 KB
testcase_17 AC 98 ms
43,052 KB
testcase_18 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N390_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] ex = new int[1000001];
		Arrays.fill(ex, -1);
		for(int v : a)ex[v] = -2;
		int id = 0;
		for(int i = 1;i <= 1000000;i++){
			if(ex[i] == -2){
				ex[i] = id++;
			}
		}
		int[] dp = new int[n];
		for(int i = 0;i < n;i++){
			dp[i] = Math.max(dp[i], 1);
			for(int j = a[i]*2;j <= 1000000;j += a[i]){
				if(ex[j] >= 0){
					dp[ex[j]] = Math.max(dp[ex[j]], dp[i] + 1);
				}
			}
		}
		out.println(Arrays.stream(dp).max().getAsInt());
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new N390_3().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0