結果

問題 No.390 最長の数列
ユーザー hiromi_ayasehiromi_ayase
提出日時 2016-07-08 23:11:08
言語 Java21
(openjdk 21)
結果
AC  
実行時間 179 ms / 5,000 ms
コード長 4,084 bytes
コンパイル時間 2,127 ms
コンパイル使用メモリ 79,064 KB
実行使用メモリ 57,848 KB
最終ジャッジ日時 2024-04-10 08:50:33
合計ジャッジ時間 4,783 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
54,024 KB
testcase_01 AC 49 ms
54,376 KB
testcase_02 AC 49 ms
54,016 KB
testcase_03 AC 50 ms
54,424 KB
testcase_04 AC 50 ms
54,428 KB
testcase_05 AC 157 ms
57,332 KB
testcase_06 AC 156 ms
56,700 KB
testcase_07 AC 50 ms
54,152 KB
testcase_08 AC 51 ms
54,364 KB
testcase_09 AC 68 ms
55,256 KB
testcase_10 AC 179 ms
57,300 KB
testcase_11 AC 175 ms
56,936 KB
testcase_12 AC 176 ms
57,580 KB
testcase_13 AC 133 ms
56,764 KB
testcase_14 AC 167 ms
57,848 KB
testcase_15 AC 49 ms
54,076 KB
testcase_16 AC 50 ms
54,420 KB
testcase_17 AC 60 ms
54,408 KB
testcase_18 AC 68 ms
55,356 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) {
		FastScanner sc = new FastScanner();
		int N = sc.nextInt();
		int[] a = sc.nextIntList(N);

		int[] dp = new int[1000001];
		Arrays.sort(a);

		for (int i = 0; i < N; i++) {
			dp[a[i]] = Math.max(dp[a[i]], 1);
			for (int k = 2; k * a[i] <= a[N - 1]; k++) {
				dp[a[i] * k] = Math.max(dp[a[i] * k], dp[a[i]] + 1);
			}
		}

		int max = 0;
		for (int i = 0; i < N; i++) {
			max = Math.max(dp[a[i]], max);
		}
		System.out.println(max);
	}

	public static List<Long> allFactors(long n) {
		if (n == 1) {
			return new ArrayList<Long>(Arrays.asList(1L));
		}
		long logN = (long) Math.sqrt(n) + 1;
		List<long[]> factors = new ArrayList<>();

		for (int i = 2; i < logN; i++) {
			if (n % i == 0) {
				long[] elem = new long[] { i, 0 };
				while (n % i == 0) {
					elem[1]++;
					n /= i;
				}
				factors.add(elem);
			}
		}
		if (n != 1) {
			factors.add(new long[] { n, 1 });
		}

		int[] count = new int[factors.size()];
		int factorsSize = factors.size();

		List<Long> list = new ArrayList<>();
		loop: while (true) {
			long x = 1;
			for (int i = 0; i < factorsSize; i++) {
				long[] v = factors.get(i);
				for (int j = 0; j < count[i]; j++) {
					x *= v[0];
				}
			}
			list.add(x);

			int idx = 0;
			while (count[idx] == factors.get(idx)[1]) {
				count[idx] = 0;
				idx++;
				if (idx == factorsSize) {
					break loop;
				}
			}
			count[idx]++;
		}
		return list;
	}
}

class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else 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 isEOS() {
		return this.eos;
	}

	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() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}
0