摘要: https://codeforces.com/problemset/problem/1253/C 题意:给定n个糖果,每天最多只能吃m个。第k天吃第a[i]的糖果的代价是a[i] * k。现有n个询问,问吃i个糖果的最小代价是多少。(1 <= i <= n) 思路:对于第i个询问,选出数值最小的前i 阅读全文
posted @ 2026-01-13 10:29 _Yxc 阅读(2) 评论(0) 推荐(0)