#424666 (Java21) No.979 Longest Divisor Sequence

• 問題: No.979 Longest Divisor Sequence
• ユーザー: Oland
• 提出日時: 2020-02-01 07:53:31
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 917 ms / 2,000 ms
• コード長: 7,183 bytes
• コンパイル時間: 2,028 ms
• コンパイル使用メモリ: 80,392 KB
• 実行使用メモリ: 59,032 KB
• 最終ジャッジ日時: 2024-09-18 19:42:47
• 合計ジャッジ時間: 5,095 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	49 ms; 50,100 KB
testcase_01	AC	49 ms; 50,496 KB
testcase_02	AC	48 ms; 50,184 KB
testcase_03	AC	50 ms; 50,664 KB
testcase_04	AC	50 ms; 50,516 KB
testcase_05	AC	49 ms; 50,436 KB
testcase_06	AC	61 ms; 50,528 KB
testcase_07	AC	49 ms; 50,464 KB
testcase_08	AC	49 ms; 50,408 KB
testcase_09	AC	49 ms; 50,500 KB
testcase_10	AC	137 ms; 55,212 KB
testcase_11	AC	124 ms; 55,492 KB
testcase_12	AC	131 ms; 56,028 KB
testcase_13	AC	140 ms; 54,868 KB
testcase_14	AC	917 ms; 59,032 KB
testcase_15	AC	459 ms; 57,032 KB

ソースコード

import java.util.*;
import java.io.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        int MAX = 3*(int)1e5;
        int N = in.nextInt();
        int[] A = in.nextIntArray(N);
        int[] maxLen = new int[MAX+1];
        int ans = 0;
        for(int i = 0; i < N; i++){
            if(A[i] == 1) maxLen[1] = 1;
            else{
                for(int e : divisor(A[i])){
                    if(e != A[i]) maxLen[A[i]] = Math.max(maxLen[A[i]], maxLen[e] + 1);
                }
            }
            ans = Math.max(ans, maxLen[A[i]]);
        }
        out.println(ans);
    }
    
    ArrayList<Integer> divisor(int n){
        ArrayList<Integer> d = new ArrayList<>();
        for(int i = 1; i * i <= n; i++){
            if(n % i == 0){
                d.add(i);
                if(i * i != n) d.add(n / i);
            }
        }
        Collections.sort(d);
        return d;
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}