[UVA][greedy] 10747 - Maximum Subsequence
Problem H
Maximum Subsequence
Input: Standard Input
Output: Standard Output
Time Limit: 2 Second
You are given a sequence of N integers,
each of which is not greater than 10,000 considering absolute value.
There are (NCK) sub-sequences possible f...
