HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Recursion > problem:


51081 - Fish Pond I

Section problems

• 50381 - Sum of the numbers
• 50389 - Reverse an Array
• 50727 - Fibonacci Numbers
• 50415 - The Scientist
• 50421 - Repairing road segments
• 50935 - Max Discount
• 50724 - Number of Circles
• 50729 - Max number in 2D array
• 51081 - Fish Pond I
• 50726 - Pascal Triangle - 1
• 50928 - War Of Battleships
• 50577 - Perfect Numbers and Perfec...
• 50721 - Palindrome

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.

Fish Pond I

Question: You work in a fishpond which has a computerized system. The system catches fishes when the fishes pass through a channel. Whenever it takes one fish, it does not have time to take the next fish.

Question: Write a program that defines the max amount to take (max total size) for all the fishes.

Input specification: First you will be given an integer, the number of fish (n). Then, starting from the following line, you will be given n integers (there may be several integers in every line - integers from 1 to 1000) where n is less than 25.

Output specification: Show one integer.

Sample Input I
9
5 3 2 5 5 4 1 3 2
Sample Input II
9
5 1 5 2 4 4 3 2 2
Sample Output I
17
Sample Output II
19

Explanation (Sample Input 1): If fish1 (5), fish4 (5), fish6 (4), and fish8 (3) are taken the max total size (17) are taken. (Sample Input 2): fish 1, 3, 5, 7 and 9 are taken (19).



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

www.contester.ru