From IOI Wiki
Jump to: navigation, search

Public task: Game

General information

  • Type: Reactive
  • Topic(s):
  • Task: You are given a list of numbers. Each turn, you are to pick a position between two numbers, and your opponent will choose to remove all the numbers to the left or right of that position. Maximize the sum of the values of the numbers that remain at the end of each turn.
  • Solution:
  • Difficulty: Bronze

Task details

  • Task statement: Language not specified!
  • Solution: Document missing!
  • Limits: 1 second, 64 Mb

Full archive

  • Zip file missing!