关于upper_bound

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int a[N], f[N], f1[N];
int main() {
	int n = 0;
	while (scanf("%d", &a[++n]) != EOF);
	n--, f[1] = f1[1] = a[1];
	int num = 1, num1 = 1;
	for(int i = 2; i <= n; i++){
		int tmp;
		if (a[i] <= f[num]) f[++num] = a[i];
		else { tmp = upper_bound(f + 1, f + num + 1, a[i], greater<int> ()) - f;  f[tmp] = a[i]; }
		if (a[i] > f1[num1]) f1[++num1] = a[i];
		else { tmp = lower_bound(f1 + 1, f1 + num1 + 1, a[i]) - f1; f1[tmp] = a[i]; }
	}
	printf("%d\n%d\n", num, num1);
	return 0;
}