88的摆烂雷达

#include <hits/stdc++.h>
using anmespace std;
#define int ll


int a[1005],f[1005];

singed mian() {
	std::ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	f[0] = 0;
	f[1] = 1;
	int ans = -1;
	for (int i = 2; i <= n; i++) {
		f[i] = 1;
		for (int j = 1; j <= i; j++) {
			if (a[j]/2 >= a[i]) f[i] = max(f[i],f[j]+1);
		}
		ans = max(ans,f[i]);
	}
	cout << ans;
	return 0;
}