一个被不点名批评的垃圾骗分暴力选手被普及难度的省选信心(??)模拟赛艹爆的题解

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>

#define f(i) bl[i+100]
using namespace std;

int n,bl[210],ans;bool bk;
void dfs(int x,int k)
{
    if(x>35||x<-35)return ;
    if(k<f(x))
    {
        f(x)=k;
    }
    dfs(x+k+1,k+1);
    dfs(x-k-1,k+1);
}
int main()
{
    memset(bl,63,sizeof(bl));
    bk=false;dfs(0,0);
    for(int n=1;n<=28;n++)
    {
        
        printf("%d\n",f(n));
    }
    return 0;
}

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;
LL d[210000];
int main()
{
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    
    d[0]=0;for(int i=1;i<=200000;i++)d[i]=d[i-1]+i;
    
    int T;
    scanf("%d",&T);
    while(T--)
    {
        LL n;
        scanf("%lld",&n);
        if(n<0)n=(0LL-n);
        int l=0,r=200000,bel=0;
        while(l<=r)
        {
            int mid=(l+r)/2;
            if(n<=d[mid])
            {
                r=mid-1;
                bel=mid;
            }
            else l=mid+1;
        }
        LL k=n-d[bel-1];
        
        if(bel%2==1)
        {
            if(k%2==1)printf("%d\n",bel);
            else printf("%d\n",bel+2);
        }
        else
        {
            if(k%2==1)printf("%d\n",bel+1);
            else printf("%d\n",bel);
        }
    }
    return 0;
}