Water Tapping

 1.Try 1


// Online C++ compiler to run C++ program online

#include <iostream>

#include <bits/stdc++.h>

using namespace std;


void freq(int* arr,int n){

    int res=1;

    int i=0;

    while(i<n){

        if (arr[i]==arr[i+1]){

            res+=1;

        }

        else {

            cout<<arr[i]<<" "<<res;

            res=1;

            cout<<endl;

        }

        i++;

    }

}



void local_min(int* arr,int n){

    for (int i=0;i<n;i++){

        if (arr[i+1]>arr[i] && arr[i-1]>arr[i]){

            cout<<arr[i]<<" ";

            

        }

    }

}


void local_max(int* arr,int n){

    for (int i=1;i<n-1;i++){

        if (arr[i+1]<arr[i] && arr[i-1]<arr[i]){

            cout<<arr[i]<<" ";

            

        }

    }

    if (arr[0]>arr[1]){

        cout<<arr[0]<<" ";

    }

    if (arr[n-1]>arr[n-2]){

        cout<<arr[n-1]<<" ";

    }

}


bool is_des(int* arr, int n){

    for(int i=0;i<n-1;i++){

        if (arr[i+1]>arr[i]){

            return false;

        }

        

    }

    return true;

}


void rev(int*arr, int n){

    int l=0;

    int h=n-1;

    while(l<h){

        swap(arr[l],arr[h]);

        l++;

        h--;

    }

    

}

int water_tap(int* arr, int n){

    int m=0;

    int res=0;

    cout<<is_des(arr,n)<<endl;

    if(is_des(arr,n)==1){

        rev(arr,n);

        res=0;

        

    }

    for (int i=0;i<n;i++){

        cout<<m<<" ";

        cout<<arr[i]<<endl;

        m=max(arr[i],m);

        if(arr[i]!=m){

            res=res+(m-arr[i]);

        }

        

    }

    return res;

}

int main() {

    int arr[10]={5,4,2,3,1};

    int n=5;

    

    cout<<water_tap(arr,n);


    return 0;

}


2. Solution:

// Online C++ compiler to run C++ program online

#include <iostream>

#include <bits/stdc++.h>

using namespace std;


int water_tap(int* arr, int n){

    int res=0;

    for(int i=0;i<n;i++){

        int lmax=arr[i];

        for(int j=0;j<i;j++){

            lmax=max(arr[j],lmax);

        }

        int rmax=arr[i];

        for(int j=i+1;j<n;j++){

            rmax=max(arr[j],rmax);

        }

        cout<<lmax<<" "<<rmax<<endl;

        if(min(lmax,rmax)-arr[i]>0){

            res=res+min(lmax,rmax)-arr[i];

        }

        

    }

    return res;

}

int main() {

    int arr[10]={3,0,3,0,3};

    int n=5;

    

    cout<<water_tap(arr,n);


    return 0;

}

Comments

Post a Comment

Popular posts from this blog

Sum of Even Numbers till N

Given a number N, print sum of all even numbers from 1 to N. #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){         if (i%2==0){             sum=sum+i;         }     }     cout<<sum;    } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){     ...
Read more

Find the Runner-Up Score!

  Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given     scores. Store them in a list and find the score of the runner-up. Input Format The first line contains  . The second line contains an array     of   integers each separated by a space. Constraints Output Format Print the runner-up score. Sample Input 0 5 2 3 6 6 5 Sample Output 0 5 Explanation 0 Given list is  . The maximum score is  , second maximum is  . Hence, we print   as the runner-up score. ### OPTIMIZED ### from   collections   import   Counter if  __ name__  ==  '__main__' :      n  =  int ( input ())      arr  =  map ( int ,   input () . split ())           lis = list ( Counter ( arr ) . keys ())      lis . sort ()  ...
Read more

Print All Substrings

  For a given input string(str), write a function to print all the possible substrings. Substring A substring is a contiguous sequence of characters within a string. Example: "cod" is a substring of "coding". Whereas, "cdng" is not as the characters taken are not contiguous Input Format: The first and only line of input contains a string without any leading and trailing spaces. All the characters in the string would be in lower case. Output Format: Print the total number of substrings possible, where every substring is printed on a single line and hence the total number of output lines will be equal to the total number of substrings. Note: The order in which the substrings are printed, does not matter. Constraints: 0 <= N <= 10^6 Where N is the length of the input string. Time Limit: 1 second Sample Input 1: abc Sample Output 1: a ab abc b bc c  Sample Input 2: co Sample Output 2: c co o #include <iostream> #include <cstring> us...
Read more