Codeforces 1334 C. Circle of Monsters

题意：

n n n 只怪物围成一圈，每只怪物拥有体力 a a a 和爆炸伤害 b b b 如果怪物 i i i 死亡，则与他相邻的下一只怪物将受到 b i b_i bi 点伤害，每次你能随便挑一只怪物开一枪，那只怪物的体力将会降低 1 1 1 点，问至少需要开多少枪才能解决掉所有怪物。

AC代码：

ll ar[300050], br[300050];
int main()
{int t;sd(t);while (t--){int n;ll k = 0, minn = INF, d;sd(n);rep(i, 0, n - 1){sldd(ar[i], br[i]);d = ar[i] - br[i - 1];if (i){if (d > 0)minn = min(minn, br[i - 1]), k += d;elseminn = min(minn, ar[i]);}}d = ar[0] - br[n - 1];if (d > 0)minn = min(minn, br[n - 1]), k += d;elseminn = min(minn, ar[0]);pld(k + minn);}return 0;
}

Codeforces 1334 C. Circle of Monsters相关推荐

CodeForces - 1334C Circle of Monsters(贪心)
题目链接:点击查看题目大意:给出一个有顺序的环形敌人序列,每个敌人有两个属性,分别记为 a 和 b ,a 为该敌人的血量,需要相应的子弹数量才能击败,当敌人 i 被击败后,他会爆炸,对第 i + ...
Codeforces 1189B Number Circle
题目链接:http://codeforces.com/problemset/problem/1189/B AC代码: #include<bits/stdc++.h> using names ...
CodeForces - 1189B Number Circle
原题传送器<----点我 **题意:**n个数字,请你给它们排个序围成一个环,满足任意一个数两边的数之和大于它本身,例如题目给的图(左图为正确答案),如果不存在这样的环就输出NO. 难度★ 题解 ...
Codeforces 1334 D. Minimum Euler Cycle
题意: 给出一个 n n n 个顶点的有向完全图,找出字典序最小的欧拉回路经过的顶点,然后从 L L L 输出到 R R R 为止. 如果把 n = 5 n=5 n=5 画个图,会发现欧拉序列长这样: ...
Codeforces补题记录(1)
文章目录 Codeforces补题记录(1) 1.Codeforces Round #632 (Div. 2)(2020.4.11) A.Little Artem B.Kind Anton *C.Eu ...
Codeforces Round #562 (Div. 2) A.Circle Metro
链接:https://codeforces.com/contest/1169/problem/A 题意: The circle line of the Roflanpolis subway has n ...
CodeForces - 1296D Fight with Monsters
一.内容 There are n monsters standing in a row numbered from 1 to n. The i-th monster has hi health poi ...
Circle Metro CodeForces - 1169A
Circle Metro The circle line of the Roflanpolis subway has nn stations. There are two parallel route ...
CodeForces - 1368F Lamps on a Circle(交互+贪心)
题目链接:点击查看题目大意:给出一个环状的灯泡,标号为 1 ~ n ,初始时全部为熄灭状态,现在两个人开始玩游戏,第一个人可以选择继续游戏,也可以选择结束游戏,继续游戏的话首先选择一个正整数 k , ...

Codeforces 1334 C. Circle of Monsters

题意：

AC代码：

Codeforces 1334 C. Circle of Monsters相关推荐

最新文章

热门文章