#include using namespace std; typedef long long ll; typedef vector VI; typedef vector VVI; typedef vector VL; typedef vector> VVL; typedef pair Pair; typedef tuple tpl; #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define REVERSE(c) reverse((c).begin(),(c).end()) #define EXIST(m,v) (m).find((v)) != (m).end() #define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin() #define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin() #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i) #define RREP(i,n) RFOR(i,n,0) #define en "\n" constexpr double EPS = 1e-9; constexpr double PI = 3.1415926535897932; constexpr int INF = 2147483647; constexpr long long LINF = 1LL<<60; constexpr long long MOD = 998244353; // 1000000007; template inline bool chmax(T& a, T b){if(a inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} int f(Pair a){ return a.second - a.first; } void Main(){ int N; cin >> N; auto cmp = [](Pair a, Pair b){ int la = a.second - a.first, lb = b.second - b.first; return la < lb; }; priority_queue, decltype(cmp)> q(cmp); q.emplace(0,200200); set st{0}; auto get_val = [&](int a){ auto it = st.lower_bound(a); if(it != st.end()){ if(a == *it) return 0; } it--; return a - *it; }; int ans = 0; REP(i,N){ int a; cin >> a; int K = get_val(a); if(K == 0) continue; vector v; while(!q.empty() and f(q.top())>K){ Pair p = q.top(); q.pop(); v.push_back(p); } for(auto& [fi, se] : v){ q.emplace(fi, fi+K); q.emplace(fi+K, se); st.insert(fi+K); } ans++; } cout << ans << en; return; } int main(void){ cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<>t; while(t--) Main(); return 0; }