1 条题解
-
0
#include<bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } int a = 0; int b = 1; for (int i = 1; i < n; i++) { if (arr[i] == arr[i - 1]) { b++; } else { a = max(a, b); b = 1; } } a = max(a, b); cout << a << endl; return 0; }-
（￣～￣）好无聊 (董启航)
@ 2025-6-18 19:30:57
#include<bits/stdc++.h> using namespace std; int main() { int n, curr, prev, max_len = 1, curr_len = 1; cin >> n >> prev;
for (int i = 1; i < n; ++i) { cin >> curr; if (curr == prev) { curr_len++; if (curr_len > max_len) max_len = curr_len; } else { curr_len = 1; prev = curr; } } cout << max_len; return 0;}
-
（￣～￣）好无聊 (董启航)
@ 2025-6-18 19:31:20
using namespace std; int main() { int n, curr, prev, max_len = 1, curr_len = 1; cin >> n >> prev; for (int i = 1; i < n; ++i) { cin >> curr; if (curr == prev) { curr_len++; if (curr_len > max_len) max_len = curr_len; } else { curr_len = 1; prev = curr; } } cout << max_len; return 0; }
-
俞威佑
LV 7
@ 2025-6-14 14:50:30
- 1
