結果

問題 No.921 ずんだアロー
ユーザー OlandOland
提出日時 2019-11-09 07:14:03
言語 Java19
(openjdk 21)
結果
AC  
実行時間 140 ms / 2,000 ms
コード長 5,948 bytes
コンパイル時間 3,427 ms
コンパイル使用メモリ 75,520 KB
実行使用メモリ 58,328 KB
最終ジャッジ日時 2023-10-13 06:44:31
合計ジャッジ時間 6,142 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,508 KB
testcase_01 AC 41 ms
49,564 KB
testcase_02 AC 41 ms
49,520 KB
testcase_03 AC 41 ms
49,628 KB
testcase_04 AC 39 ms
49,676 KB
testcase_05 AC 41 ms
49,512 KB
testcase_06 AC 45 ms
49,540 KB
testcase_07 AC 45 ms
49,752 KB
testcase_08 AC 40 ms
49,504 KB
testcase_09 AC 43 ms
49,372 KB
testcase_10 AC 128 ms
57,980 KB
testcase_11 AC 133 ms
57,820 KB
testcase_12 AC 89 ms
54,032 KB
testcase_13 AC 123 ms
55,472 KB
testcase_14 AC 118 ms
55,404 KB
testcase_15 AC 108 ms
55,800 KB
testcase_16 AC 64 ms
51,744 KB
testcase_17 AC 122 ms
55,896 KB
testcase_18 AC 133 ms
58,076 KB
testcase_19 AC 131 ms
57,764 KB
testcase_20 AC 135 ms
57,960 KB
testcase_21 AC 133 ms
58,328 KB
testcase_22 AC 133 ms
58,312 KB
testcase_23 AC 140 ms
57,952 KB
testcase_24 AC 130 ms
57,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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

@SuppressWarnings("unused")
public class Main {
    private FastScanner in = new FastScanner(System.in);
    private PrintWriter out = new PrintWriter(System.out);
    final 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 N = in.nextInt();
        int[] A = in.nextIntArray1Index(N);
        //for(int e : A) out.println(e);
        long[][] dp = new long[N+1][2];
        for(int i = 1; i <= N; i++){
            dp[i][0] = Math.max(dp[i-1][0], dp[i-1][1]);
            dp[i][1] = (A[i] == A[i-1] ? Math.max(dp[i-1][0], dp[i-1][1]) : dp[i-1][0]) + 1;
        }
        out.println(Math.max(dp[N][0], dp[N][1]));
    }
    //end solve

    public static void main(String[] args) {
        new Main().m();
    }

    private void m() {
        solve();
        out.flush();
    }

    static class FastScanner {
        Reader input;

        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}

        int nextInt() {return (int) nextLong();}

        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;
            }
        }

        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;
            }
        }

        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        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 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;
        }
    }
}
0