cgtllp1的博客

Problem DescriptionHDU’s n classrooms are on a line ,which can be considered as a number line. Each classroom has a coordinate. Now Little Q wants to build several candy shops in these n classrooms....

https://acm.uestc.edu.cn/problem/fang-chai/description聪明的做法#include <bits/stdc++.h>using namespace std;typedef long long ll;const int MAXN = 100005;const ll mod = 1e9+7;int n, m;st...

a b c 相邻b>a,b>c删除a，b，c添加a+c-b相当于删除a，c，改b权值priority_queue不支持以上删除操作打标记#include <bits/stdc++.h>#define val first#define id secondusing namespace std;typedef long long...

两种做法都是要用到分块在线的题的地址是https://acm.uestc.edu.cn/problem/dong-ma-he-sha-tian-xia-di-yi/description题意简化就是求一个区间内的最大众数，本来是看了网上的在线区间众数求法（https://blog.youkuaiyun.com/BerryKanry/article/details/75478987?location...

outputstandard outputA string s is given. Also there is a string p, and initially it is empty. You need to perform q operations of kind «add a letter to the end of the string p» and «remove a lett...

Pavel had two positive integers a and b. He found their sum s and greatest common divisor g, and forgot a and b after that. Help him to restore the original numbers.InputA single line contains two...

 H. Safe Pathtime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputYou play a new RPG. The world map in it is represented by a grid of n × m ce...

题目描述小马哥有 nn 杯盐水，第 ii 杯有 a_{i}a​i​​ 单位的盐和 b_{i}b​i​​ 单位的水。小马哥很无聊，于是他想知道有多少种这 nn杯盐水的非空子集，倒在一起之后盐和水的比是 \displaystyle \frac{x}{y}​y​​x​​. 输入格式 输入第一行包含一个整数T，代表数据组数。每组数据第一行包含三个整数n,x,y(2&lt;=n&lt...

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array of positive integers. While there are at least two equal el...

 题目描述 第一次期中考终于结束啦！沃老师是个语文老师，他在评学生的作文成绩时，给每位学生的分数都是一个小于10的非负小数。Amy 8.999999999999999999999999999999999999999990000Bob 8.9999999999999999999999999999999999999999800Cat 8.999999999999999999999...

A 跳台阶Description 有一个n级台阶的楼梯，小明一开始在第0个台阶，小明一次可以向上跳1步，两步...甚至是n步，请问小明跳到n级台阶有多少种跳法？Input 第一行输入一个整数t，代表有t组样例:（ T&lt;=30）接下来的t行，都用一个整数n，表示楼梯有n级台阶（ 1&lt;=n&lt;=30）Output 输出跳到第n级台阶有多少...

Problem DescriptionLittle Q wants to buy a necklace for his girlfriend. Necklaces are single strings composed of multiple red and blue beads.Little Q desperately wants to impress his girlfriend, he...

https://acm.uestc.edu.cn/problem/ren-zai-di-shang-zou-guo-cong-tian-shang-lai/description将点当成左闭右开的线段，然后每次查是否有位置填，也就是一个点维护和一个线段维护就可以了#include <bits/stdc++.h>using namespace std;const in...