题目链接：https://codeforces.com/gym/102220/problem/J
#include"iostream" #include"cstdio" #include"stdlib.h" #include"cmath" #include"cstring" #include"cstdlib" #include"vector" #include"stack" #include"queue" #include"set" #include"map" #include"algorithm" #include <utility> #include <iomanip> #include <time.h> #include<list> const double PI=acos(-1.0); using namespace std; #define mem(a,b) memset(a,b,sizeof(a)) #define lowbit(x) x&-x #define inf 0x3f3f3f3f #define pr pair<int,int> typedef pair<char,int> PAIR; struct CmpByValue { bool operator()(const PAIR& lhs, const PAIR& rhs) { return lhs.second > rhs.second; } }; //priority_queue<int,vector<int>,greater<int>> pp; const int mod = 998244353 ; const int M = 1e6 + 10; const int limt = 1<<20; const int INF = 1e9; typedef long long ll; ll t,n,m,b,a,d,r,ox,oy,l,i,j; ll cnt,sum; ll k; int main() { cin>>t; while(t--) { sum=0; scanf("%lld",&n); scanf("%lld",&a); sum=a*3; for(int i=2;i<=n;i++) { scanf("%lld",&a); if(sum<a+1) { sum=a+1; } } if(sum%2==1) { sum++; } printf("%lld\n",sum); } return 0; }