CodeForces 1529B

最新推荐文章于 2024-10-10 22:59:02 发布

新城R

最新推荐文章于 2024-10-10 22:59:02 发布

阅读量93

点赞数 1

文章标签：算法

本文链接：https://blog.csdn.net/weixin_51732964/article/details/118066502

版权

Sifid and Strange Subsequences

题目链接

A sequence (b1,b2,…,bk) is called strange, if the absolute difference between any pair of its elements is greater than or equal to the maximum element in the sequence. Formally speaking, it’s strange if for every pair (i,j) with 1 ≤ i < j ≤ k, we have |ai−aj|≥MAX, where MAX is the largest element of the sequence. In particular, any sequence of length at most 1 is strange.

For example, the sequences (−2021,−1,−1,−1) and (−1,0,1) are strange, but (3,0,1) is not, because |0−1|<3.

Sifid has an array a of n integers. Sifid likes everything big, so among all the strange subsequences of a, he wants to find the length of the longest one. Can you help him?

A sequence c is a subsequence of an array d if c can be obtained from d by deletion of several (possibly, zero or all) elements.

题目大意：任何两个数的差值都大于最大的数的序列叫做奇怪求出一个序列的奇怪（若只有一个数则必为奇怪）

Input

The first line contains an integer t (1 ≤ t ≤ 1e4) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n (1 ≤ n ≤ 1e5) — the length of the array a.

The second line of each test case contains n integers a1,a2,…,an (−1e9 ≤ ai ≤ 1e9) — the elements of the array a.

It is guaranteed that the sum of n over all test cases doesn’t exceed 1e5.

Output

For each test case output a single integer — the length of the longest strange subsequence of a.

Example

input

6
4
-1 -2 0 0
7
-3 4 -2 0 -4 6 1
5
0 5 -3 2 -5
3
2 3 1
4
-3 0 2 0
6
-3 -2 -1 1 1 1

output

Note

In the first test case, one of the longest strange subsequences is (a1,a2,a3,a4)

In the second test case, one of the longest strange subsequences is (a1,a3,a4,a5,a7).

In the third test case, one of the longest strange subsequences is (a1,a3,a4,a5).

In the fourth test case, one of the longest strange subsequences is (a2).

In the fifth test case, one of the longest strange subsequences is (a1,a2,a4).

分析

要想任意一对数的差值大于最大值则须满足最多有一个正数

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int t,n,i,b,k,l,f,minn,a[101010];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		l=0,k=1e9+7,f=-1;
		for(i=0;i<n;i++)
		{
			scanf("%d",&b);
			if(b<=0) a[l++]=b;
			else k=min(k,b);
		}
		if(k==1e9+7) f=n;
		else if(l==0) f=1;
		else if(l==1) f=2;
		if(f<0)
		{
			sort(a,a+l);
			minn=a[1]-a[0];
			for(i=0;i<l-1;i++)
				minn=min(minn,a[i+1]-a[i]);
			if(minn>=k) f=l+1;
			else f=l;
		}
		printf("%d\n",f);
	}
	return 0;
}