forked from codemistic/Data-Structures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtrappingWaterProblem.cpp
64 lines (51 loc) · 1.03 KB
/
trappingWaterProblem.cpp
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <bits/stdc++.h>
using namespace std;
class Solution{
public:
long long trappingWater(int arr[], int n){
long long mxR[n];
long long mxL[n];
mxL[0] = arr[0];
mxR[n-1] = arr[n-1];
for(int i =1;i<n;i++){
if(mxL[i-1]>arr[i]){
mxL[i] = mxL[i-1];
}
else{
mxL[i] = arr[i];
}
}
for(int i =n-2;i>=0;i--){
if(mxR[i+1]>arr[i]){
mxR[i] = mxR[i+1];
}
else{
mxR[i] = arr[i];
}
}
long long water[n];
for(int i =0;i<n;i++){
water[i] = min(mxR[i],mxL[i]) - arr[i];
}
long long sum =0;
for(int i =0;i<n;i++){
sum = sum+ water[i];
}
return sum;
}
};
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;
}