最近終於大概弄懂斜率優化到底是什麼了
花了好久的時間弄懂
這篇主要是在講查詢單調&斜率單調的斜率優化
所以沒有動態凸包&李超線段樹(因為這兩個我都不會)
斜率優化簡介
斜率優化的dp式大概長這樣
$$dp[i] = \mathop{min}\limits_{j<i}(a[j] * x[i] + b[j] ) + c[i]$$
Are you sure to leave this team?
Once you delete your team, all team notes will be deleted and cannot be recovered. Please ensure you've exported or transfered these notes.
Enter team name before deleting it:
or
By clicking below, you agree to our terms of service.
Sign in with Wallet
New to HackMD? Sign up
