int mxl[size]; int mxr[size]; mxl[0]=arr[0]; for(int i=1;i<size;i++) { mxl[i]=max(mal[i-1],arr[i]); } mxr[size-1]=arr[size-1]; for(int i=size-2;i>=0;i--) { mxr[i]=max(mxr[i+1],arr[i]) } int water[size]; for(int i=0;i<size;i++) water[i]=min(mxl[i],mxr[i])-arr[i]; int sum=0; for(int i=0;i<size;i++) sum=sum+water[i]; return sum;
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter