/* regensburg by bell Challenge] It's raining! You've recently discovered that you're a pluviophile and thus have decided to move to Raintown, where it rains indefinitely. All the buildings in Raintown are rectangular prisms, each with a 1x1 square as base, lined up in a single row on Rain Street. There is no empty space between them. It is guaranteed that rain will fall as much as needed so that any excess rain would overflow from building to building ultimately reaching ground. There are no walls on either side of Rain St. However the buildings are squeezed between two walls that run the length of Rain St. so that water gets trapped between the two walls. (That is, water can only flow in a left-right direction) A friend of yours has given you a list of the buildings' heights. Being the rain-enthusiast that you are, you decide to write a program that would tell you how much water can be trapped between buildings given enough time for the rain to fall. Examples: > 8 5 7 3 6 4 1 6 12 > 4 1 3 5 2 3 4 7 > 5 2 4 3 1 3 2 6 4 1 15 */ #include #include using namespace std; int rain(vector v){ int j,max=0,sum=0,m=0; cout<m)m=*it; sum+=*it; cout<<*it<<" "; } max=m*v.size()-sum; cout<0;i--){ j=0; while(v[j]0;i--){ j=v.size()-1; while(v[j] v1={8, 5, 7, 3, 6, 4, 1, 6}; vector v2={4, 1, 3, 5, 2, 3, 4}; vector v3={5, 2, 4, 3, 1, 3, 2, 6, 4, 1}; cout<<"Raintown actually exists! Check it out under geo location 49.01340 12.10160"<

RegensBurgZuke