hdu6154 找规律

#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
#define rep(i,a,b) for (int i=a; i<=b; ++i)
#define per(i,b,a) for (int i=b; i>=a; --i)
#define mes(a,b)  memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define MP make_pair
#define PB push_back
#define fi  first
#define se  second
typedef long long ll;
const int N = 200005;

int s, arr[N], tot;
void Init()
{
    int a = 2, b = 1;
    arr[4]=2, arr[5]=2, arr[6]=4;
    rep(i,7,N-1)
    {
        if(i&1) arr[i] = arr[i-1]+a-1;
        else {
            arr[i] = arr[i-2]+a*2;
            b += 1;
            if(a<b) swap(a, b);
        }
        if(arr[i]>1e9) { tot=i;  break; }
    }
}
int main()
{
    Init();
    int T;  scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &s);
        printf("%d\n", lower_bound(arr+4, arr+tot+1, s) - arr);
    }

    return 0;
}