#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int a[100005];
int main() {
int n; cin >> n;
int b = 0, maxb = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = -1;
for (int i = 1; i <= n; i++) {
if (a[i] > a[i - 1]) {
b++;
if (b > maxb)maxb = b;
}
else b = 1;
}
cout << maxb;
return 0;
}
2第二种满分方法.
使用两个变量的数组存放比较数据,避免数组太大而超时
用a[2]输入数据,用a[1]存放之前输入的数据
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int a[3];
int main() {
int n; cin >> n;
int b = 0, maxb = 0;
for (int i = 1; i <= n; i++) {
cin >> a[2];
if (a[2] > a[1]) {
b++;
maxb = max(b, maxb);
}
else b = 1;
a[1] = a[2];
}
cout << maxb;
return 0;
}