[UVA][dp] 10688 - The Poor Giant
Problem A
The Poor Giant
Input: Standard Input
Output: Standard Output
Time Limit: 1 second
On a table, there are n apples, the i-th apple has the weight
k+i(1<=i<=n). Exactly one of the apples is sweet, lighter apples
are all bitter, while heavier apples are a...
