qq_52410477的博客

cf

文章目录Codeforces Round #791 (Div. 2)A. AvtoBus题意：思路代码B. Stone Age Problem题意思路代码C. Rooks Defenders题意思路代码D. Toss a Coin to Your Graph...题意思路代码Codeforces Round #791 (Div. 2)链接A. AvtoBus题意：两种车， 一种需要四个车轮， 一个需要六个车轮， 知道有几个车轮， 问最多几辆车， 最少几辆车思路无解 ： 小于4 或者是 奇数有

文章目录Codeforces Round #787 (Div. 3)A. Food for Animals题意代码B. Make It Increasing题意思路代码C. Detective Task题意思路代码D. Vertical Paths题意思路代码E. Replace With the Previous, Minimize题意思路代码F. Vlad and Unfinished Business题意思路代码G. Sorting PancakesCodeforces Round #787 (Di

D2. Too Many Segments (hard version)（线段树维护当前点又几条线段， 贪心删除右端点最远的一条边）代码：#include<iostream>#include<queue>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;const int N=2e5+10;struct tree { int l

B. Arpa’s weak amphitheater and Mehrdad’s valuable Hoses并查集+ dp#include <bits/stdc++.h>using namespace std;const int N = 1010 ;int b[N] , w[N] , p[N] ,f[N];int n , m, ww ;int x , y ; vector<int>ve[N] ; int find(int x ){ if(p[x] !=

文章目录Codeforces Round #702 (Div. 3)A. Dense ArrayB. Balanced RemaindersC. Sum of CubesD. Permutation TransformationE. Accidental VictoryF. Equalize the ArrayCodeforces Round #702 (Div. 3)链接A. Dense Array链接题意：如果序列 a的任意相邻两项中，较大者不大于较小者的二倍，则 Polycarp 称 a 是

文章目录Codeforces Global Round 16A. Median MaximizationB. MIN-MEX CutC. MAX-MEX CutD1. Seating Arrangements (easy version)D2. Seating Arrangements (hard version)Codeforces Global Round 16链接A. Median Maximization链接题目大意：给定两个正整数 n 和 s。找到一个由 n 个非负整数（不一定是不同的）