spoj: classical ⇝ wpc4f ⇝ Through the troops

simple dp problem.


             ⇢⇢⇢⇢ mat[x][y]                             if x = 0
           ↗
dp[x][y] ⇶⇶
           ↘
             ⇢⇢⇢⇢ mat[x][y] + min(dp[x - 1][i])          i ∈ [0, n) - [y]


https://gist.github.com/13964f5900357bcd19b3

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s