Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Re:dp

Posted by Drizzle at 2007-02-23 20:07:56 on Problem 3186
In Reply To:dp Posted by:Sempr at 2007-01-27 22:11:29

> dp[i+1][j] = Max(dp[i+1][j], dp[i][j]+(i+1)*v[k]);
> dp[i+1][j+1] = Max(dp[i+1][j+1], dp[i][j]+(i+1)*v[N-1-j]);

偶瞎搞了一个，竟然ac了。。晕了
f[i][j] = max(f[i - 1][j] + data[i - 1] * (N + i - j - 1), f[i][j + 1] + data[j + 1] * (N + i - j - 1));
特例
f[i][i] + data[i] * N

Followed by:

Re:dp (176) 20053565 2007-03-01 16:05:47
- Re:dp (26) oibeginner 2007-11-14 21:03:53

Post your reply here:

Home Page Go Back To top