3坨黑求助
查看原帖
3坨黑求助
1234029
npc000楼主2024/1/23 18:57
#include<bits/stdc++.h>
#pragma optimize(3)
using namespace std;
long long a[100005]={99999999},b,c,x,y,z,i=0,j=2,k=0,n,m,sum=0,num=0,r,t,s=0;
bool flag,flagg=0;
char ch,bb;
long double cc;
string aa; 
long long minn=99999999;
long long read() 
{
    bool flag=false;
	int x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')
			flag=true;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
    return flag?-x:x;
}
void write(int x)
{
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);putchar(x%10+'0');
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
    n=read();
    m=n;
    for(i=1;i<=n;++i)
    {
    	a[i]=read();
	}
	sort(a+1,a+n+1);
    for(i=1;i<n;++i)
    {
    	if(a[i+1]-a[i]<minn)
    	{
    		minn=a[i+1]-a[i];
		}
	}	
    for(i=1;i<m;++i)
    {
    	if(a[i+1]-a[i]>minn)
    	{
    		m++;
    		a[m]=a[i]+minn;
    		sort(a+1,a+m+1);    		
    		while(a[i+1]-a[i]>minn)
    		{
        		m++;
    			a[m]=a[i]+minn;			
    			sort(a+1,a+m+1);
			}
		}
	}	
    write(m); 
	return 0;
}

提交记录

蒟蒻思路清奇,各位神犇不要见怪

2024/1/23 18:57
加载中...