turtle的博客

Problem Description This is Kolakosiki sequence: 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1……. This sequence consists of 1 and 2, and its first term equals 1. Besides, if you see adjacent and eq

Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 1

Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the

代码还没平台提交，不保证正确 比赛时没看懂题意，赛后根据官方题解写了一个能过样例的代码 分成两次贪心，第一次贪心先看能不能干掉Bob所有的怪。如果可以，选择最优策略（用最少的花费干掉防御怪，剩下的直接加起来减去攻击怪的力量和就行） 得出最大伤害值。   第二次，直接用力量最大的怪去打Bob力量最小的怪（攻击怪，打防御怪没有用），直到打不赢为止 最后选择两种贪心中伤害值更大的一个 ...