Problem Statement:
Codeforces Round #353 (Div. 2) - C. Money Transfers
Summary:
Given a circular array A[1..n] such that the sum of all its elements is zero, find the minimum number of steps needed to make every A[i] equal zero, if at each step we can take any value from A[i] (with positive value) and move it to either A[i-1] or A[i+1] (elements on immediate left/right of A[i]).
Showing posts with label Circular Array. Show all posts
Showing posts with label Circular Array. Show all posts
Wednesday, June 1, 2016
Subscribe to:
Posts (Atom)