Rain water harvesting

#1

complexity n^2
code
#include<bits/stdc++.h>
using namespace std;
int trapedwater(int a[],int n){
int res=0;
for(int i=1;i<n-1;i++){
int left=a[i];
for(int j=0;j<i;j++){
left=max(left,a[j]);
}
int right=a[i];
for(int j=i+1;j<n-1;j++){
right=max(right,a[j]);
}
res= res + (min(left,right)-a[i]);
}
return res;
}
int main(){
int n;
int a[n];
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
cout<<trapedwater(a,n)<<endl;
return 0;
}
which testcase is failing ? can you tell me

#2

@Vivek-Pandey-2129725577345937 hey vivek please share your code on ide then share it here.

#3

#include<bits/stdc++.h>
using namespace std;
int trapedwater(int a[],int n){
int res=0;
for(int i=1;i<n-1;i++){
int left=a[i];
for(int j=0;j<i;j++){
left=max(left,a[j]);
}
int right=a[i];
for(int j=i+1;j<n-1;j++){
right=max(right,a[j]);
}
res= res + (min(left,right)-a[i]);
}
return res;
}
int main(){
int n;
int a[n];
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
cout<<trapedwater(a,n)<<endl;
return 0;
}

#4

@Vivek-Pandey-2129725577345937 hey vivek follow this