小bai月赛49 E 禅（DP）

登录—专业IT笔试面试备考平台_牛客网牛客网是互联网求职神器，C++、Java、前端、产品、运营技能学习/备考/求职题库，在线进行百度阿里腾讯网易等互联网名企笔试面试模拟考试练习,和牛人一起讨论经典试题,全面提升你的技术能力https://ac.nowcoder.com/acm/contest/11226/E

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <string>
#define lowbit(x) ((x)&(-x))
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e6 + 5;
using ll = long long ;
using ull = unsigned long long ;

int n;
ll a[MAXN];
ll f[MAXN];
inline void solve() {
	int pos;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", a + i);
		if (a[i] == 0)
			pos = i;
	}
	if (n == 1)
		return void(printf("No Solution\n"));
	ll ans = INF;
	if (pos - 1 >= 1) {
		f[pos - 1] = a[pos - 1] + 1;
		ans = min(f[pos - 1], ans);
		for (int i = pos - 2; i >= 1; i--) {
			f[i] = max(f[i + 1] - a[i], a[i] + 1);
			ans = min(f[i], ans);
		}
	}
	if (pos + 1 <= n) {
		f[pos + 1] = a[pos + 1] + 1;
		ans = min(f[pos + 1], ans);
		for (int i = pos + 2; i <= n; i++) {
			f[i] = max(f[i - 1] - a[i], a[i] + 1);
			ans = min(f[i], ans);
		}
	}
	printf("%lld\n", ans);
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--)
		solve();
	return 0;
}