HDU 5037 Frog——贪心

HDU 5037 Frog——贪心

#include #include #include #include using namespace std;const int maxn = 2e5+5;int a[maxn];int main() { int T; scanf("%d", &T); for (int kase = 1; kase <= T; kase++) { int n, m, l; scanf("%d %d %d", &n, &m, &l); for (int i = 1; i <= n; i++) scanf("%d", &a[i]); sort(a+1, a+1+n); a[n+1] = m; int ans = 0, cur = 0, pre = -l; for (int i = 1; i <= n+1; i++) { ans += (a[i]-cur) / (l+1) * 2; pre += (a[i]-cur) / (l+1) * (l+1); if (a[i]-pre > l) { pre = cur+(a[i]-cur)/(l+1)*(l+1); ans++; } cur = a[i]; } printf("Case #%d: %d\n", kase, ans); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。