Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
62266 | 王一涵(吃土豆长大的马铃薯) | 最长平台 | C++ | Accepted | 0 MS | 248 KB | 279 | 2025-03-13 17:18:54 |
#include<iostream> using namespace std; int main(){ int max = 0, l = 1, a[1000], n; cin >> n; for(int i = 0; i < n; i++){ cin >> a[i]; if(a[i] == a[i-1]){ l++; } else{ if(l > max){ max = l; l = 1; } } } cout << max; return 0; }