Link

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int m,n;
int a[501],x[1001],y[1001],f[1001];
int g;
struct tree
{
	int dx;
	int dy;
	double dis;
}mtr[1001];
bool cmp(tree t,tree r)
{
	return t.dis<r.dis;
}
int search(int p)
{
	if(f[p]!=p)f[p]=search(f[p]);
	return f[p];
}
int main()
{
	int i,j,k;
	scanf("%d",&m);
	int ans=m;
	for(i=1;i<=m;++i)scanf("%d",&a[i]);
	scanf("%d",&n);
	for(i=1;i<=n;++i)scanf("%d %d",&x[i],&y[i]);
	for(i=1;i<=n;++i)
	{
		for(j=1;j<=n;++j)
		{
			if(i!=j)
			{
				mtr[++g].dx=i;
				mtr[g].dy=j;
				mtr[g].dis=sqrt(abs(pow(x[i]-x[j],2)+pow(y[i]-y[j],2)));
			}
		}
	}
	sort(mtr+1,mtr+1+g,cmp);
	for(i=1;i<=m;++i)
	{
		for(k=1;k<=n;++k)f[k]=k;
		for(j=1;j<=g;++j)
		{
			int r1=search(mtr[j].dx),r2=search(mtr[j].dy);
			if(r1!=r2)
			{
				if(mtr[j].dis>a[i])
				{
					ans--;
					break;
				}
				f[r2]=r1;
			}
		}
	}
	printf("%d",ans);
	return 0;
}