Hello everyone,

I am trying to solve this problem on topcoder ( ** SRM 678 div2 1000 ptr ** )

Not able to get the idea on how to solve!

Please help me in arriving at the solution !

*Thanks in advance !* :)

EDIT : Anyone please?

Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems.
×

# | User | Rating |
---|---|---|

1 | MiFaFaOvO | 3681 |

2 | tourist | 3669 |

3 | Um_nik | 3535 |

4 | 300iq | 3317 |

5 | ecnerwala | 3294 |

6 | maroonrk | 3268 |

7 | TLE | 3223 |

8 | scott_wu | 3209 |

9 | WZYYN | 3180 |

10 | boboniu | 3174 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 197 |

2 | antontrygubO_o | 185 |

3 | Ashishgup | 182 |

3 | pikmike | 182 |

5 | vovuh | 179 |

6 | Radewoosh | 173 |

7 | SecondThread | 167 |

8 | Um_nik | 164 |

9 | Monogon | 163 |

10 | McDic | 162 |

Hello everyone,

I am trying to solve this problem on topcoder ( ** SRM 678 div2 1000 ptr ** )

Not able to get the idea on how to solve!

Please help me in arriving at the solution !

*Thanks in advance !* :)

EDIT : Anyone please?

↑

↓

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/11/2020 18:08:10 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

I'm not sure whether my solution is correct..

First consider if we can shift all these n-1 stairs, we will want to shift them averagely. So we can do a dp[now_stair][shifting_used], make sure that now_stair is not shifted. For transition we enumerate how many stairs after now_stair to be shifted, and shift them to average positions. The time complexity is O(n^4).

I didn't get you, Can you please explain?

Suppose we have 2 stairs, the bottom is 0, the top is 10, and we can shift both of the 2 stairs. Then shifting them to 0, 3, 6, 10 won't be worse than any other shiftings. Like this, in our shifting plan, a consecutive shifted stairs should be averagely placed between the stair before them and the stair after them. So we can use a dp to solve this.

The reason that the position should be chosen averagely is Lagrange Multipliers.