#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[100010], b[100010], c[100010];
int main()
{
	int n = 1, maxn = 0, cur = 0;
	while (cin >> a[n]) n++;
	for (int i = n; i >= 1; i--) for (int j = i + 1; j <= n; j++) if (a[i] >= a[j]) c[i] = max(c[i], c[j] + 1);
	for (int i = 1; i <= n; i++) maxn = max(maxn, c[i]);
	b[++cur] = a[1];
	for (int i = 2; i <= n; i++)
	{
		bool flag = false;
		sort(b + 1, b + cur + 1);
		for (int j = 1; j <= cur; j++) if (b[j] >= a[i])
		{
			b[j] = a[i];
			flag = true;
			break;
		}
		if (!flag) b[++cur] = a[i];
	}
	cout << maxn << endl << cur << endl;
    return 0;
}

评测记录