## Colliot5/12/2018, 8:08:01 AM

keyboard_arrow_down

## Colliot6/18/2023, 4:03:05 PM

keyboard_arrow_down

## Colliot6/21/2023, 1:53:37 AM

keyboard_arrow_down

## Colliot6/20/2023, 7:41:31 PM

keyboard_arrow_down

## hugify6/19/2023, 7:59:42 PM

https://leetcode.com/contest/weekly-contest-350/problems/painting-the-walls/ 说白了就是：Given two integer arrays cost and time of size n. Choose m <= n indices M from {0, 1, ..., n-1}, s.t. \sum_{i \in M} \mathrm{time}i + m >= n, while minimizing \sum{i \in M} \mathrm{cost}i. 其中 \sum{i \in M} \mathrm{time}i + m >= n 这个约束，第二项是 m 个 paid painter 的贡献，第一项是在这些 paid painter 工作期间，free painter 可以做的贡献。容易想到它可转化为 \sum{i \in M} (\mathrm{time}_i + 1) >= n，那么把 time 的每个元素 + 1，就化为了原版的「有容量下界限制的背包问题」。

keyboard_arrow_down

## Colliot1/9/2019, 1:48:57 AM

keyboard_arrow_down

## Colliot9/18/2019, 12:49:35 AM

keyboard_arrow_down
Voevodsky 当年错误的地方是什么？

## Colliot12/16/2017, 4:49:32 PM

@Nicekingwei 你知道吗？

keyboard_arrow_down

## zjuwyd8/12/2021, 4:29:59 AM

keyboard_arrow_down

## Reiko2/2/2021, 6:14:41 PM

keyboard_arrow_down

# Latest Replies

## Colliot replied to 阿里巴巴数学竞赛选错赛道了

begin{equation} B'_t= begin{cases} B_t & text{if } t le s 2B_s-B_t & text{if } t > s end{cases} end{equation}

textbf{} extbf{}