TRT - Treats for the Cows
FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given period time. The treats are interesting for many reasons:
- The treats are numbered 1..N and stored sequentially in single file in a long box that is open at both ends. On any day, FJ can retrieve one treat from either end of his stash of treats.
- Like fine wines and delicious cheeses, the treats improve with age and command greater prices.
- The treats are not uniform: some are better and have higher intrinsic value. Treat i has value v(i) (1 <= v(i) <= 1000).
- Cows pay more for treats that have aged longer: a cow will pay v(i)*a for a treat of age a.
Given the values v(i) of each of the treats lined up in order of the index i in their box, what is the greatest value FJ can receive for them if he orders their sale optimally?
The first treat is sold on day 1 and has age a=1. Each subsequent day increases the age by 1.
Input
Line 1: A single integer, N
Lines 2..N+1: Line i+1 contains the value of treat v(i)
Output
The maximum revenue FJ can achieve by selling the treats
Example
Input: 5 1 3 1 5 2 Output: 43
hide comments
Shantanu Banerjee:
2015-12-24 11:42:40
A must for the beginners, including me! :) |
|
irbis9:
2015-11-17 19:07:09
My first dp on my own without looking for hints or solution. |
|
sanyamg123:
2015-11-03 04:54:26
dont use a 2d map instead use a 2d array... 2d map gives tle while 2d array gives ac |
|
gaurav117:
2015-10-29 13:09:20
a must for the beginners :) |
|
Akshay Damle:
2015-10-17 21:06:35
Couple of pointers: Don't use Python/Java. Use long long int to store result. Use 2D array not map for the memo if you're doing it that way. |
|
Durgesh Deep:
2015-09-15 22:50:43
my 50th :) |
|
ziadxkabakibi:
2015-09-12 11:04:24
recursion = TLE,recursion + memory =ACC ^_^ it's simple |
|
thirupathireddy:
2015-09-11 12:53:55
nice treat of dp............:) |
|
ramjeet saran:
2015-08-30 14:44:15
AC 0.00 :)
|
|
coder_shishir:
2015-08-30 13:37:04
easy one,,,,,recursion+memoization.....
|
Added by: | Nguyen Van Quang Huy |
Date: | 2006-02-15 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 VB.NET |
Resource: | USACO FEB06 Gold Division |