Pls help in this problem

7 months ago, # ^ |

This approach fails on the sample test case itself

→ Reply

AymanRefat

7 months ago, # ^ |

yes, you are right. it just finds some number but not the maximum.

→ Reply

7 months ago, # |

could it be like a knapsack prob???

→ Reply

7 months ago, # ^ |

and we would use dp , so that it wouldnt give tle

→ Reply

7 months ago, # ^ |

N is 10^5 i dont think it works

→ Reply

7 months ago, # ^ |

yeah no but using dp with knapsack, it would be O(n), we could at every position i store the max number of element we can make negative and if we reaach on that point again, we just use it, im not 100% sure whether this would work or not, im in the process of learning dp.

→ Reply

7 months ago, # ^ |

If u want to use dp u need to maintain current sum as well in the state and ai<=10^9, so it is not feasible

→ Reply

7 months ago, # ^ |

yeah ig, it would make it a 2D dp, and that would give memory limit exceeded, could you send the question link??,i could give it a try, tho most prolly wont be able to.

→ Reply

7 months ago, # ^ |

I don't have link bro.. some friend asked this question to me

→ Reply

7 months ago, # ^ |

oo :/, welp but im sure this isnt possible without using dp.

→ Reply

7 months ago, # ^ |

How?

→ Reply

7 months ago, # |

I think this solution may work , only because we have N positive integers in the array at the initial state .

Make a segment tree for the given array

Now make a copy of original array and sort it.Doing so we help to give us the smallest number to run our check function.

Now starting from the smallest number, find the fist occurrence from right side (greedy approach), check if it can be turned into negative with the help of segment tree ( get sum 0,i ) and if its True, turn it and update the segment tree with update( i, -2*a[i] ) and ans++.

If its a False, skip this number and move on to the next ... do so for all

→ Reply

Carrot-Pie

7 months ago, # ^ |

It sounds like a good idea, but the problem is that checking the amount on the prefix [0; i] is not enough.

Consider this example: 4 3 2, first you'll make a negative two, because 4 + 3 > 2, than you'll make a negative three, because 4 > 3, however, after such actions, the sum on prefix [0; 2] will become negative (4 - 3 - 2 = -1).

To solve this problem, you can maintain in the leaves of the segment tree not the elements of the array, but the prefix sums of the array.

Now, when you change one of the elements (for example, element i), you will need to increase all the prefix sums containing the given element (that is, do the operation -= 2 * a[i] on the segment [i; n - 1]).

And for the function of checking a given number, it will be enough to take the minimum prefix sum, containing this element and check that it is greater than 2 * a[i] (that is, do the minimum search operation on the segment [i; n - 1] and compare it with 2 * a[i]).

But I'm still not sure that this solution works correctly and it's worth to prove it strictly.

→ Reply

Carrot-Pie

7 months ago, # ^ |

Let's look at the operation of the algorithm using the same example. After building a segment tree, the numbers 4 7 9 will be stored in the leaves (these are prefix sums of an array). Now algorithm will try to make the two negative and it will succeed, because the minimum prefix sum on the segment [2; 2] is equal to nine, which is greater than 2 * 2. That's why segment tree will be updated to 4 7 5. Then algorithm will try to make the three negative, but it'll be unsuccessful, because minimum prefix sum on segment [1; 2] is equal to five, which is less than 3 * 2.

→ Reply

7 months ago, # ^ |

Yes, may be there must be a much simpler solution to this.

→ Reply

Carrot-Pie

7 months ago, # ^ |

I think that this solution is the best, it's pretty easy and I believe that it's correct.

→ Reply

7 months ago, # ^ |

Thanks for the careful observation, using lazy propagation , it can be managed under Nlog(N).

→ Reply

Pranav16

7 months ago, # |

ig can be done with heaps

would be happy if someone finds some wrong testcase, cause greedy's are weird

void solve(){
    int n;cin>>n;
    vector<int> a(n);
    for(int&x:a) cin>>x;
    priority_queue<int> neg;
    neg.push(-1e18);
    priority_queue<int,vector<int>,greater<int>> pos;
    pos.push(1e18);
    int sum=0;
    int count=0;
    for(int i=0;i<n;i++){
        while(pos.top()<neg.top()){
            int x=pos.top();
            int y=neg.top();
            neg.pop();
            pos.pop();
            sum-=x;
            sum+=y;
            pos.push(y);
            neg.push(x);
        }
        if(sum-a[i]>0){
            sum-=a[i];
            neg.push(a[i]);
            count++;
        }else{
            pos.push(a[i]);
            sum+=a[i];
        }
    }
    cout<<count<<endl;
}

→ Reply

7 months ago, # ^ |

← Rev. 2 →

Is not working on

1 3 3 1

→ Reply

vstiff

7 months ago, # |

← Rev. 2 →

let mut sum = 0;
let mut q = BinaryHeap::new();
for a in aa {
    q.push(a);
    sum -= a;
    if sum <= 0 {
        sum += 2 * q.pop().unwrap();
    }
}

println!("{}", q.len());

→ Reply

7 months ago, # ^ |

can u pls explain ur logic

→ Reply

vstiff

7 months ago, # ^ |

Here is the sum and queue after each element:

adding 5: 5 []
adding 2: 3 [2]
adding 3: 6 [2]
adding 5: 1 [5, 2]
adding 2: 9 [2, 2]
adding 3: 6 [3, 2, 2]
3

→ Reply

650iq

7 months ago, # ^ |

Hi vstiff, what is the intuition behind this and why this works?

→ Reply

vstiff

7 months ago, # ^ |

I really don't know what to explain here, no math, no constructives, no observations. Just remember what you negated and revert if you negated too much.

→ Reply

Sanjit-OP

7 months ago, # |

Who else failed to solve this problem during Amazon OA test.

→ Reply

adaptatron

7 months ago, # |

I already have a blog : Time Travel in Greedy Algorithms and practice problems on this topic.

→ Reply