-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path48th day
45 lines (44 loc) · 880 Bytes
/
48th day
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
45
#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
long long trappingWater(int arr[], int n)
{
int left[n], right[n];
left[0] = arr[0];
right[n - 1] = arr[n - 1];
for (int i = 1; i < n; i++)
{
left[i] = max(arr[i], left[i - 1]);
}
for (int i = n - 2; i >= 0; i--)
{
right[i] = max(arr[i], right[i + 1]);
}
long long ans = 0;
for (int i = 0; i < n; i++)
{
ans += min(left[i], right[i]) - arr[i];
}
return ans;
}
};
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
Solution obj;
cout << obj.trappingWater(a, n) << endl;
}
return 0;
}