File size: 625 Bytes
ff444f7 |
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 |
#include <iostream>
#include <vector>
using namespace std;
int solve() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = 0;
vector<int> left(N + 1), right(N + 1);
for (int i = 0; i < N; i++) {
left[i + 1] = max(0, A[i] - left[i]);
}
for (int i = N - 1; i >= 0; i--) {
right[i - 1] = max(0, A[i] - right[i]);
}
for (int i = 0; i < N; i++) {
ans += max(0, A[i] - left[i] - right[i]);
}
return ans;
}
int main() {
int T;
cin >> T;
for (int t = 1; t <= T; t++) {
cout << "Case #" << t << ": " << solve() << endl;
}
return 0;
}
|