http://codeforces.com/problemset/problem/702/A Maximum Increase

扫过去，记录前驱当前值，比较一下，更新答案。

#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#define MAX 100005
#define mod 998244353ll
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
int main() {
    freopen("a.txt", "r", stdin);
    freopen("b.txt", "w", stdout);
    int n, x, pre;
    cin >> n;
    pre = INF;
    int ans = 1, s = 0;
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &x);
        if (x <= pre) s = 1;
        else s++, ans = max(ans, s);
        pre = x;
    }
    cout << ans << endl;
    return 0;
}