We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://ptilopsisw.github.io/2022/09/04/%E8%80%83%E8%AF%95%E6%80%BB%E7%BB%93/
2022.9.1 A 传球 原题ARC124E 一个比较难的DP 首先可以发现必定有一个人没有传球,因为每个人都少传一个球的话状态不变。 然后考虑式子的实际含义,即为每个人在自己手中选一个球的方案数。 所以我们可以对着实际含义来做,每个人手上的球的来源只有原来没有传出去的球和上一个人传过来的球,所以我们可以将球的来源记录在DP状态里。 设 fi,0f_{i,0}fi,0 表示 第 i−1i-1i
The text was updated successfully, but these errors were encountered:
No branches or pull requests
https://ptilopsisw.github.io/2022/09/04/%E8%80%83%E8%AF%95%E6%80%BB%E7%BB%93/
2022.9.1 A 传球 原题ARC124E 一个比较难的DP 首先可以发现必定有一个人没有传球,因为每个人都少传一个球的话状态不变。 然后考虑式子的实际含义,即为每个人在自己手中选一个球的方案数。 所以我们可以对着实际含义来做,每个人手上的球的来源只有原来没有传出去的球和上一个人传过来的球,所以我们可以将球的来源记录在DP状态里。 设 fi,0f_{i,0}fi,0 表示 第 i−1i-1i
The text was updated successfully, but these errors were encountered: