随笔分类 -  2025ACM

摘要:牛客练习赛141_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ A-小柒与啦啦啦的博弈_牛客练习赛141 题意:有 \(n\) 个物品,价值为 \(a_i\),两个人轮流取,求各自的拿到的物品的最大价值和。 题解:排序后模拟取。 点击查看代码 #include<bit 阅读全文
posted @ 2025-06-23 15:35 梨愁浅浅 阅读(57) 评论(1) 推荐(2)
摘要:Dashboard - The 2025 Hunan Multi-School Programming Training Contest, Round 10 - Codeforces Problem - M - Codeforces 给定 \(d\),构造 \(a,b,c\) 使得不能用加减乘除组合 阅读全文
posted @ 2025-05-18 17:02 梨愁浅浅 阅读(85) 评论(0) 推荐(0)
摘要:Dashboard - 2022-2023 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Preferably Teams) - Codeforces Problem - E - 阅读全文
posted @ 2025-05-08 19:58 梨愁浅浅 阅读(109) 评论(0) 推荐(0)
摘要:Dashboard - 2025 Hunan Multi-School Training Round 6 - Codeforces Problem - E - Codeforces 灯的亮度应不小于两个路灯距离除二,注意两端的距离不除二。 #include<bits/stdc++.h> using 阅读全文
posted @ 2025-04-13 23:34 梨愁浅浅 阅读(59) 评论(0) 推荐(3)
摘要:J 签到 A 模拟 Problem - M - Codeforces 做过加强版:AT_abc262_h [ABC262Ex] Max Limited Sequence - 洛谷 直接沿用 \(dp_{i,j}\) 表示考虑完前 \(i\) 个位置,上一个取到的位置为 \(j\) 且满足右端点 \( 阅读全文
posted @ 2025-04-07 00:13 梨愁浅浅 阅读(31) 评论(1) 推荐(1)
摘要:Dashboard - 2025 Hunan Multi-School Training Round 2 - Codeforces D 排序后从中间向两边取。 I,J,B,H参考博客:https://www.cnblogs.com/lyrrr/p/18780739 Problem - K - Cod 阅读全文
posted @ 2025-03-19 12:13 梨愁浅浅 阅读(93) 评论(0) 推荐(1)
摘要:补题链接 J 题 纯签到题,比较前四个队伍的最强队与后四个队伍的最强队,输出总决赛结果。 点击查看代码 #include<bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long l 阅读全文
posted @ 2025-03-05 22:17 梨愁浅浅 阅读(1441) 评论(8) 推荐(1)