#include #include using namespace std; typedef long long ll; typedef pair P; long long int INF = 3e18; const ll fact_table = 800008; double Pi = 3.1415926535897932384626; //vector G[550010]; //vector

tree[500010]; priority_queue pql; priority_queue

pqp; //big priority queue priority_queue ,greater > pqls; // priority_queue ,greater

> pqps; //small priority queue //top pop ll dx[8]={1,0,-1,0,1,1,-1,-1}; ll dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //ll bit[500005]; //↓,→,↑,← #define p(x) cout< number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[fact_table + 5],rfact[fact_table + 5]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=fact_table; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[fact_table] = rui(fact[fact_table],mod - 2); for(ll i=fact_table; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;} */ ll n,m,num,sum,a,b,c,d,e,g,h,w, i,j,q,r,l; ll k; ll ans; ll x[500005], y[200005], z[200005]; // char s[500005], t[500005]; bool used[3005][3004]; ll dp[3004][3004]; char s[2005][2005]; ll ruiseki(ll l, ll r){ return y[r] - y[l]; } ll solve(ll i, ll j){ // pe(i);p(j); // dp[i][j]の結果を求める if(dp[i][j] != 0)return dp[i][j]; if(i == j){ if(x[i] > k){ return 1; }else{ return 2; } } ll l, r; l = i; r = j; vector v; for(ll i=l+1;i<=r;i++){ if(ruiseki(l, i) <= k)v.pb(solve(i, r)); } for(ll i=l;i> n >> k; for(ll i=0;i> x[i]; } for(ll i=0;i