For this Question: You are given array A of size n. You need to find the maximum-sum sub-array with the condition that you are allowed to skip at most one element.The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer n denoting the size of array. The second line contains n space-separated integers A1, A2, ..., An denoting the elements of the array.

Constraints:
1 <= T <= 10
1 <= n <= 10^5
-10^3 <= Ai<= 10^3For each test case, in a new line, print the maximum sum.Input:
2
5
1 2 3 -4 5
8
-2 -3 4 -1 -2 1 5 -3

Output:
11
9

Explanation:
Testcase1:
Input  : A[] = {1, 2, 3, -4, 5}
Output : 11
We can get maximum sum subarray by skipping -4.
Testcase2:
Input  : A[] = [-2, -3, 4, -1, -2, 1, 5, -3]
Output : 9
We can get maximum sum subarray by skipping -2 as [4, -1, 1, 5] sums to 9, which is  the maximum achievable sum., I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
 
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

int a[N], l[N], r[N];

signed main() {
	IOS;
	int t;	cin >> t;
	while(t--){
		int n, ans = 0;	cin >> n;
		for(int i = 1; i <= n; i++){
			cin >> a[i];
			l[i] = max(a[i], a[i] + l[i-1]);
			ans = max(ans, l[i]);
		}
		r[n+1] = 0;
		for(int i = n; i >= 2; i--){
			r[i] = max(a[i], a[i] + r[i+1]);
			ans = max(ans, l[i-2] + r[i]);
		}
		cout << ans << endl;
	}	
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?