plzzzz help meeeeeeeeeeeee.. i neeeddd your help :* <3
plzzzz help meeeeeeeeeeeee.. i neeeddd your help :* <3
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
1) sort by T1P1 + (T1+T2)P2 < T2P2 + (T1+T2)P1
2) maximize dp[time][problemPosition] — pair<double, double> = (EP, -ET)
Can you make some explanation for the first step? :v
that's also what i've been wondering..... plz help me goo.gl_SsAhv
For a fixed set of problems there is optimal order to solve them to minimize ET. This sorting gives optimal order. Let's start from some fixed order. Then repeat swap(i, j) until there exists two elements i and j i < j and TiPi + (Ti+Tj)Pj > TjPj + (Ti+Tj)Pi. It's the same as soring above and gives optimal order.
it started to make sense now.... thank you so muchhhhhh >.<