HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Dynamic programming & Greedy > problem:


50681 - Center of a Series

Guest
• Review clarifications (1)

Section problems

• 50536 - Epoka Furgon Shpk
• 50687 - Pascal Triangle - 2
• 50689 - The biggest building block
• 50686 - The Container
• 50682 - Hotel Durres
• 50930 - Tom and Jerry
• 50526 - Gold Market
• 50488 - Connecting Wires
• 50681 - Center of a Series
• 50561 - Lucky tickets
• 50598 - Minimum Sum
• 50601 - Increasing sequence
• 50613 - Zapakovka
• 50680 - Triangle
• 50683 - Parking Buses
• 50685 - Guest Room Usage
• 50544 - Stock market

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan, First used in IMPC-13 Nov.

Center of a Series

Weight center of a series of numbers where the difference between sum of left side and sum of right side elements is the minimum.

Question: Write a program that is going to read n positive integers and decide the weight center of the series.
Note: The order of elements are not changed, just the difference between sum of left and right sides of every element is calculated.

Example: If you have the following list:
  10 9 4 15 8 2 2 5 2 5
If you take the 5th element (8) as the weight center of the list.

  • Sum of the numbers on the left of it is 38
  • Sum of the numbers on the right of it is 16
giving the difference 22. If you take 4th element (15) as the weight center of the list.
  • Sum of the numbers on the left of it is 23
  • Sum of the numbers on the right of it is 24
giving the minimum difference (1).

Input specification
There is one number (n) at the begining representing the number of numbers in the list (lst) where 1 ≤ n ≤ 100000. and 1 ≤ lsti ≤ 10000. Then in the following lines you have n numbers (at most 1000 numbers per line).

Output specification
Show the position of weight center of the list. Note: Element positions in the list starts from 1.

Sample Input I
  9
  3 9 5 8 4 4 1 7 2
Sample Input II
  6
  7 5 10 5 8 2
Sample Output I
  4
Sample Output II
  3


Для отправки решений необходимо выполнить вход.

www.contester.ru