huanghai
/
python
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b7c3f8675f'
${ noResults }
python/TangDou/AcWing/DP/ConvexHullTrick/UVA12983.md

556 B
Raw Blame History Escape

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

UVA12983 The Battle of Chibi

题目传送门

离散+dp动规+树状数组优化

状态表示 dp[i][j] 表示以第 i 个数结尾,长度为 j 的 严格上升子序列 的个数

状态转移

\large dp[i][j]=\sum_{k=1,a_k<a_i}^{i-1} dp[k][j-1]

TODO 挖坑待填

现在还没有复习树状数组、线段树等知识，等复习后，第三轮复习DP斜率优化时，再综合树状数组的知识对此详细理解，撰写题解。 2022-9-30