- 博客(43)
- 收藏
- 关注
原创 CF1466H Finding satisfactory solutions
CF1466H Finding satisfactory solutions题目大意有nnn个人,第iii个人初始的时候手上有物品iii他们之间可以交换物品,每人恰好拿到一个物品,而每个人有对物品的偏好,第iii个人的偏好排序{si,n}\{ s_{i,n} \}{si,n}来表示 第iii个人相较于物品yyy更喜欢物品xxx,当且仅当在排列{si,n}\{ s_{i,n} \}{si,n}中xxx在yyy之前对于一个物品交换的排列ppp,表示地iii个物品最后到了pip_ipi的手上 对于
2022-05-12 17:38:00
220
原创 CF1342F Make It Ascending
CF1342F Make It Ascending题目大意给定一个长度为nnn的序列aaa,每次可以选择两个位置i,j(i≠j)i,j(i\not=j)i,j(i=j),令aj=ai+aja_j=a_i+a_jaj=ai+aj并将aia_iai从序列中删除求将原序列变成严格单调上升序列的最少操作次数n≤15n\le15n≤15题目相当于:求将序列aaa划分成若干集合S1,S2,⋯ ,ScS_1,S_2,\cdots,S_cS1,S2,⋯,Sc,集合之间有序,满足SiS_i
2022-05-12 17:35:50
287
原创 质数表(2)(200000~300000)
200003,200009,200017,200023,200029,200033,200041,200063,200087,200117,200131,200153,200159,200171,200177,200183,200191,200201,200227,200231,200237,200257,200273,200293,200297,200323,200329,200341,2003...
2020-01-30 16:35:15
3841
原创 质数表(1)(200000以内)
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,2...
2020-01-30 16:32:31
10133
原创 [Usaco]2011 Jan Roads and Planes 道路和航线
https://blog.youkuaiyun.com/dhdhdhx/article/details/95581696
2019-09-07 16:15:30
163
原创 [Usaco]2011 Jan Roads and Planes 道路和航线
https://blog.youkuaiyun.com/dhdhdhx/article/details/95581696
2019-09-07 16:14:48
239
原创 [Usaco]2011 Jan Roads and Planes 道路和航线
https://blog.youkuaiyun.com/dhdhdhx/article/details/95581696
2019-09-07 16:05:24
171
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人