茗少

模拟

ACM心得(1) dp(3) JavaEE(11) Javafx(1) JavaSE(1) java后端开发(1) Letcode(8) mysql(1) Spring(1) SQL(2) 企业真题(3) 图论(1) 总结(1) 搜索(2) 数论(1) 未归档(4) 构造(1) 牛客网多校训练(1) 牛客网比赛(1) 项目(2)

/ 注册

全部文章 / 模拟（共13篇）

牛客网暑期ACM多校训练营（第四场) F题 Beautiful Garden

链接：https://www.nowcoder.com/acm/contest/142/F 来源：牛客网题目描述 There's a beautiful garden whose size is n x m in Chiaki's house. The garden can be part...

2019-12-29

0 557

Rectangles

题目链接 http://codeforces.com/contest/1028/problem/C 题意：刚开始想用二维数组暴力做，后来发现数据太大数组根本开不了那么大，后来发现模拟下可以过，我们可以将每个矩形的点的横坐标看作a[i].x，a[i].x1，纵坐标看作a[i].y，a[i].y...

2019-12-29

0 594

Codeforces Round #565 (Div. 3) C. Lose it!

题目内容： C. Lose it! time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are g...

2019-12-29

0 542

字节跳动2018校招真题----编程题2

题目描述有一个仅包含’a’和’b’两种字符的字符串s，长度为n，每次操作可以把一个字符做一次转换（把一个’a’设置为’b’，或者把一个’b’置成’a’)；但是操作的次数有上限m，问在有限的操作数范围内，能够得到最大连续的相同字符的子串的长度是多少。输入描述: 第一行两个整数 n , m ...

2019-12-29

0 931

Codeforces 1183D----Candy Box (easy version)

题意: This problem is actually a subproblem of problem G from the same contest. There are nn candies in a candy box. The type of the ii-th candy i...

2019-12-29

0 833

codeforces 1186C----Vus the Cossack and Strings

题意: Vus the Cossack has two binary strings, that is, strings that consist only of "0" and "1". We call these strings aa and bb...

2019-12-29

0 823

Bad Prices

题目描述: Polycarp analyzes the prices of the new berPhone. At his disposal are the prices for nn last days: a1,a2,…,ana1,a2,…,an, where aiai is the pric...

2019-12-29

0 688

Book Reading

题目描述: Polycarp is reading a book consisting of nn pages numbered from 11 to nn. Every time he finishes the page with the number divisible by mm, he w...

2019-12-29

0 499

Equalizing by Division (easy version)

题目描述: The only difference between easy and hard versions is the number of elements in the array. You are given an array aa consisting of nn integers...

2019-12-29

0 734

操作系统模拟进程实验

#include<bits/stdc++.h> using namespace std; struct PCB{ //进程名 char process_name[20]; //进程id int process_id; //优先数 int p...

2019-12-29

0 581