[ICPC2018 Qingdao R] Plants vs. Zombies 传送门 题面翻译 给定 n n n 个植物和 m m m 的步数限制,每个植物在位置 1 … n 1\dots n 1…n 上。你初始时在位置 0 0 0,每次可以移动到相邻的位置上。 每次设你走完一步后到达的位置是 i i i,则会使得这个位置的植物的高度增加 a i a_i ai。设 d i
Problem A. I Count Two Three(点击转到) Time limit: 1s Color of balloons: 32768K I will show you the most popular board game in the Shanghai Ingress Resistance Team. It all started several months ago. We f
ACM-ICPC 2017 Asia Qingdao 常见问题 题目列表排名:-问答 A. Battle in Two Pairs of Heroes 题库链接 通过率: 33.33 %通过人数: 1 B. Chenchen, Tangtang and ZengZeng 题库链接 通过率: 97.3 %通过人数: 36 C. Collecting Cents 题库链接 通过率: 0
K XOR Clique BaoBao has a sequence a1,a2,...,an. He would like to find a subset S of {1,2,...,n} such that ∀i,j∈S, ai⊕aj<min(ai,aj) and ∣S∣ is maximum, where ⊕ means bitwise excl