随笔分类 - OJ-codeforces
摘要：n个点(n include include include include include include include include include include include include include include include include include define m
阅读全文
摘要：给你一个长度为 $\left|s\right|$ 的01串 $s$ ，每次操作你可以任选一个 $k$ ，使01串的 $[1,k]$ 和 $(k,\left|s\right|]$ 分别翻转（其中一个区间可以为空），求经过任意次操作后能得到的最长的01交替出现的子串的长度。（实际题目中01用w和b代替）
阅读全文
摘要：``` include include include include include include include include include include include include include include include include include include de
阅读全文
摘要：https://www.luogu.org/problemnew/show/CF1027C include include include include include include include include include include include include include
阅读全文
摘要：#include<cstdio> #include<string> #include<cstdlib> #include<cmath> #include<iostream> #include<cstring> #include<set> #include<queue> #include<algori
阅读全文
摘要：Professor GukiZ is concerned about making his way to school, because massive piles of boxes are blocking his way. In total there are n piles of boxes,
阅读全文
摘要：B. The Festive Evening time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output It's the end of July –
阅读全文
摘要：C. Little Girl and Maximum Sum time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output The little gi
阅读全文
摘要：【题意】：给你n个可重叠区间和一个参考值k，然后进行q次询问，每次询问也是一个区间，问你该区间中有多少个整数在n个区间中出现次数 =k include include include include include include include include include include in
阅读全文
摘要：You are given an array d1,d2,…,dn consisting of n integer numbers. Your task is to split this array into three parts (some of which may be empty) in s
阅读全文
摘要：Polycarp is practicing his problem solving skill. He has a list of n problems with difficulties a1,a2,…,an, respectively. His plan is to practice for
阅读全文
摘要：Polycarp has n coins, the value of the i th coin is ai. It is guaranteed that all the values are integer powers of 2 (i.e. ai=2d for some non negative
阅读全文
摘要：``` The heat during the last few days has been really intense. Scientists from all over the Berland study how the temperatures and weather change, and
阅读全文
摘要：``` You are given three integers a, b and x. Your task is to construct a binary string s of length n=a+b such that there are exactly a zeroes, exactly
阅读全文
摘要：A sequence a1,a2,…,an is called good if, for each element ai, there exists an element aj (i≠j) such that ai+aj is a power of two (that is, 2d for some
阅读全文
摘要：You are given two strings s and t. In a single move, you can choose any of two strings and delete the first (that is, the leftmost) character. After a
阅读全文
摘要：Little girl Tanya climbs the stairs inside a multi storey building. Every time Tanya climbs a stairway, she starts counting steps from 1 to the number
阅读全文
摘要：Maxim wants to buy some games at the local game shop. There are n games in the shop, the i th game costs ci. Maxim has a wallet which can be represent
阅读全文
摘要："CF" 【题意】：圆形球场有n个门，Allen想要进去看比赛。Allen采取以下方案进入球场：开始Allen站在第一个门，如果当前门前面有人Allen会花费单位时间走到下一个门，如果没人Allen从这个门就进去了。球场的每个门，每单位时间可以进去一个人。问Allen最终是从哪个门进入球场的？ 【分
阅读全文
摘要：【链接】： "CF" 【代码】： include define PI acos( 1.0) define pb push_back define F first define S second define debug puts define setp cout n) { string s; cin
阅读全文
