We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Candies
  5. Discussions

Candies

  • shreshthmaurya21
     + 0 comments

    This problem was based on increasing/descreasing sequence and pure observation

    long candies(int n, vector<int> arr) {
    vector<long> candies(n, 1);
    for(int i = 0; i < n-1; i++){
        if(arr[i] < arr[i+1]){
            candies[i+1] = candies[i]+1;
        }
    }
    for(int i = n-1; i >= 1; i--){
        if(arr[i-1] > arr[i] && candies[i-1] <= candies[i]){
            candies[i-1] = candies[i] + 1;
        }
    }
    return accumulate(candies.begin(), candies.end(), 0LL);
}