| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
|
+4
What is wrong in my approach every state of dp will store a pair dp(i,0) will store that using arr[i]-k and what will be the (min,max) from index 0 to i dp(i,1) will store that using arr[i]+k and what will be the (min,max) from index 0 to i ans=min(dp(n-1)(0).second-dp(n-1)(0).first,dp(n-1)(1).second-dp(n-1)(1).first) Transition in state temp1=min(dp[i-1][1].first,arr[i]-k) //dp[i-1][1].first will store the minimum vale till i-1 index considering arr[i]-k temp2=max(dp[i-1][1].second,arr[i]-k) temp3=min(dp[i-1][0].first,arr[i]-k) temp4=max(dp[i-1][0].second,arr[i]-k) if(abs(temp1-temp2)>abs(temp3-temp4)) dp[i][0]={temp3,temp4} else dp[i][0]={temp1,temp2} //same way we can find dp[i][1] |
| Name |
|---|


