結果

問題 No.921 ずんだアロー
ユーザー OlandOland
提出日時 2019-11-09 07:14:03
言語 Java21
(openjdk 21)
結果
AC  
実行時間 171 ms / 2,000 ms
コード長 5,948 bytes
コンパイル時間 2,965 ms
コンパイル使用メモリ 78,604 KB
実行使用メモリ 47,816 KB
最終ジャッジ日時 2024-09-15 04:00:45
合計ジャッジ時間 6,740 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,128 KB
testcase_01 AC 54 ms
37,220 KB
testcase_02 AC 53 ms
37,280 KB
testcase_03 AC 53 ms
37,164 KB
testcase_04 AC 52 ms
37,168 KB
testcase_05 AC 52 ms
36,988 KB
testcase_06 AC 54 ms
37,212 KB
testcase_07 AC 53 ms
37,208 KB
testcase_08 AC 52 ms
37,128 KB
testcase_09 AC 54 ms
37,280 KB
testcase_10 AC 157 ms
47,460 KB
testcase_11 AC 157 ms
47,368 KB
testcase_12 AC 105 ms
40,552 KB
testcase_13 AC 143 ms
42,860 KB
testcase_14 AC 151 ms
43,148 KB
testcase_15 AC 137 ms
41,952 KB
testcase_16 AC 91 ms
38,572 KB
testcase_17 AC 147 ms
43,348 KB
testcase_18 AC 159 ms
47,716 KB
testcase_19 AC 166 ms
47,472 KB
testcase_20 AC 171 ms
47,796 KB
testcase_21 AC 167 ms
47,508 KB
testcase_22 AC 162 ms
47,604 KB
testcase_23 AC 160 ms
47,384 KB
testcase_24 AC 164 ms
47,816 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