10分蒟蒻

P1567 统计天数

```cpp #include <bits/stdc++.h> using namespace std; int a[1000000]; long long temp, n, sum = 1,maxn = 0; int main() { scanf("%lld", &n); for (int i = 1; i <= n; i++) { scanf("%lld", &temp); a[i] = temp; if (i >= 2) { if (a[i] > a[i - 1]) { sum++; } else { sum = 1; } } maxn = max(maxn,sum); } printf("%lld", maxn); return 0; } ```
by freoepn @ 2023-11-22 20:50:37


Emm 谢谢了OvO
by xinxin88_0v0 @ 2023-11-22 20:57:44


|