这是本文档旧的修订版!
upsolved by
upsolved by
upsolved by
solved by 2sozx Bazoka13 JJLeo
统计多少个长度为 $n$ 的由小写字母构成的串 $S$ 的回文子串数最少。
$n\le3$ 答案为 $26^n$ ;$n>3$ 答案为 $A(26,3)$.
$n\le3$ 时显然。$n>3$ 时可以构造 $abcabc\cdots$ 这样回文子串个数仅有三个,答案即为 $A(26,3)$
solved by 2sozx JJLeo
upsolved by
upsolved by
upsolved by
solved by
upsolved by
upsolved by
solved by Bazoka13
给一个凸多边形花园,手动除草需要费用$A$,用圆形除草机费用$B$,使用除草机要确保圆始终在多边形内部,求最小费用。
显然如果$A \leq B$的话可以直接手动除草,否则就把每条边向内垂直移动圆的半径的长度,求一个半平面交,没有交说明只能手动,有交就求出来交的面积$+$交的周长$*$圆的半径$+$圆的面积,手动面积用总面积减一下即可。 =====记录=====。