-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathC.cpp
44 lines (40 loc) · 1019 Bytes
/
C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl
const int MAXN = 5000+5;
int a[MAXN],n;
int b[MAXN],c[MAXN];
inline void Solve(){
scanf("%d",&n);
FOR(i,1,n) scanf("%d",a+i),b[i] = a[i],c[i] = 0;LL ans = 0;
FOR(i,1,n){
ans += a[i]-1;
if(i != n){
if(c[i] < a[i+1]) a[i+1] -= c[i];
else c[i+1] += c[i]-a[i+1]+1,a[i+1] = 1;
}
FOR(j,i+2,std::min(n,i+b[i])){
if(a[j] == 1) ++c[j];
else --a[j];
}
}
printf("%lld\n",ans);
}
int main(){
int T;scanf("%d",&T);
while(T--) Solve();
return 0;
}