結果
問題 | No.921 ずんだアロー |
ユーザー | claw88 |
提出日時 | 2019-11-08 21:36:52 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 111 ms / 2,000 ms |
コード長 | 3,698 bytes |
コンパイル時間 | 4,733 ms |
コンパイル使用メモリ | 109,084 KB |
実行使用メモリ | 35,628 KB |
最終ジャッジ日時 | 2023-10-13 03:37:20 |
合計ジャッジ時間 | 5,995 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
21,420 KB |
testcase_01 | AC | 62 ms
21,624 KB |
testcase_02 | AC | 61 ms
21,724 KB |
testcase_03 | AC | 61 ms
23,552 KB |
testcase_04 | AC | 60 ms
19,564 KB |
testcase_05 | AC | 60 ms
21,568 KB |
testcase_06 | AC | 68 ms
21,712 KB |
testcase_07 | AC | 67 ms
21,632 KB |
testcase_08 | AC | 61 ms
21,472 KB |
testcase_09 | AC | 61 ms
21,528 KB |
testcase_10 | AC | 103 ms
32,796 KB |
testcase_11 | AC | 107 ms
33,332 KB |
testcase_12 | AC | 76 ms
22,648 KB |
testcase_13 | AC | 97 ms
33,384 KB |
testcase_14 | AC | 99 ms
32,056 KB |
testcase_15 | AC | 84 ms
25,640 KB |
testcase_16 | AC | 71 ms
22,084 KB |
testcase_17 | AC | 101 ms
32,372 KB |
testcase_18 | AC | 107 ms
33,764 KB |
testcase_19 | AC | 107 ms
33,676 KB |
testcase_20 | AC | 107 ms
31,468 KB |
testcase_21 | AC | 108 ms
35,628 KB |
testcase_22 | AC | 111 ms
33,480 KB |
testcase_23 | AC | 108 ms
33,584 KB |
testcase_24 | AC | 109 ms
35,604 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using SB = System.Text.StringBuilder; //using System.Threading.Tasks; //using System.Text.RegularExpressions; //using System.Globalization; //using System.Diagnostics; using static System.Console; using System.Numerics; using static System.Math; using pair = Pair<int, int>; class Program { static void Main() { //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); new Program().solve(); Out.Flush(); } readonly Scanner cin = new Scanner(); readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑ readonly int mod = 1000000007; readonly int dom = 998244353; bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; } bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; } void solve() { int N = cin.nextint; var A = cin.scanlong; var dp = new long[2]; dp[1] = 1; for (int i = 1; i < N; i++) { var next = new long[2]; next[0] = Max(dp[0], dp[1]); if (A[i] == A[i - 1]) { next[1] = next[0] + 1; } else { next[1] = dp[0] + 1; } dp = next; } WriteLine(dp.Max()); } } static class Ex { public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values)); public static string concat<T>(this IEnumerable<T> values) => string.Concat(values); public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); } public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T> { int low = 0, high = arr.Count; int mid; while (low < high) { mid = ((high - low) >> 1) + low; if (arr[mid].CompareTo(val) < 0) low = mid + 1; else high = mid; } return low; } public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T> { int low = 0, high = arr.Count; int mid; while (low < high) { mid = ((high - low) >> 1) + low; if (arr[mid].CompareTo(val) <= 0) low = mid + 1; else high = mid; } return low; } } class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U> { public T f; public U s; public Pair(T f, U s) { this.f = f; this.s = s; } public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s); public override string ToString() => $"{f} {s}"; } class Scanner { string[] s; int i; readonly char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string[] scan => ReadLine().Split(); public int[] scanint => Array.ConvertAll(scan, int.Parse); public long[] scanlong => Array.ConvertAll(scan, long.Parse); public double[] scandouble => Array.ConvertAll(scan, double.Parse); public string next { get { if (i < s.Length) return s[i++]; string st = ReadLine(); while (st == "") st = ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return next; } } public int nextint => int.Parse(next); public long nextlong => long.Parse(next); public double nextdouble => double.Parse(next); }