算法杂烩
XiWenjuan086
这个作者很懒,什么都没留下…
展开
-
2020ccpc威海 H Message Bomb(差分)
HMessage Bomb While we enjoy chatting with friends on the internet, it is always annoying that we are overwhelmed by lots of messages in various chat groups. A great majority of these messages are actually not interesting to us, but we may miss some impo.原创 2020-10-29 11:48:36 · 183 阅读 · 0 评论 -
2020ICPC·小米 网络选拔赛第一场 J - Matrix Subtraction(差分 + 树状数组)
链接:https://ac.nowcoder.com/acm/contest/7501/J 来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 Given a matrix MM_{}M of size n×mn\times mn×m and two integers a,ba, b_{}a,b, determine weither it is possible to mak.原创 2020-10-25 20:17:24 · 230 阅读 · 0 评论 -
codeforces1428 E. Carrots for Rabbits(贪心)
E. Carrots for Rabbits time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are some rabbits in Singapore Zoo. To feed them, Zookeeper boughtnncarrots with lengthsa1,a2,a3,…,ana1,a2,...原创 2020-10-20 09:26:39 · 542 阅读 · 0 评论 -
hdu6563 Strength(贪心)
Problem Description Strength gives you the confidence within yourself to overcome any fears, challenges or doubts. Feel the fear and do it anyway! If you have been going through a rough time and feel burnt out or stressed, the Strength card encourages you原创 2020-10-12 08:50:19 · 230 阅读 · 0 评论 -
HDU - 6438 Buy and Resell (贪心 + 优先队列)
The Power Cube is used as a stash of Exotic Power. There arenncities numbered1,2,…,n1,2,…,nwhere allowed to trade it. The trading price of the Power Cube in theii-th city isaiaidollars per cube. Noswal is a foxy businessman and wants to quietly make...原创 2020-09-16 19:27:15 · 147 阅读 · 0 评论 -
牛客编程巅峰赛S1第5场 - 青铜&白银 C - 排对(归并排序求逆序对)
思路:优先队列求出每个人的最短用时,归并排序求最短用时的逆序对 归并排序将两段区间 [l, mid] 和 [mid + 1, r] 合并时,如左区间中 a[i] > a[j],a[j]与 a[i] ~ a[mid] 都构成逆序对,ans += mid - i + 1; #include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 10; ll b[100010], t[..原创 2020-07-23 23:38:47 · 146 阅读 · 0 评论 -
HDU - 6665 Calabash and Landlord(离散化 + dfs)
Calabash is the servant of a landlord. The landlord owns a piece of land, which can be regarded as an infinite 2D plane. One day the landlord set up two orthogonal rectangular-shaped fences on his land. He asked Calabash a simple problem: how many nonempt.原创 2020-07-09 18:40:19 · 235 阅读 · 0 评论 -
HDU - 6667 Roundgod and Milk Tea (Hall定理 || 贪心)
Roundgod and Milk Tea Time Limit: 6000/6000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1534Accepted Submission(s): 724 Problem Description Roundgod is a famous milk tea lover at Nanjing University second t...原创 2020-07-09 16:04:22 · 232 阅读 · 0 评论 -
codeforces1343 D. Constant Palindrome Sum(差分)
D. Constant Palindrome Sum time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output You are given an arrayaaconsisting ofnnintegers (it...原创 2020-04-22 16:11:00 · 349 阅读 · 0 评论 -
中国石油大学ACM俱乐部开放训练赛---问题 K: 数学问题(预处理 + 二维前缀和)
问题 K: 数学问题 时间限制: 1 Sec内存限制: 128 MB 提交: 381解决: 24 [状态] [提交] [命题人:外部导入] 题目描述 我们高中曾经学过何为组合数。 那么,给出整数n,m,g,聪明的你能否求出有多少整数对(i,j),满足g整除吗?(其中0≤i≤n,0≤j≤min(i,m))。 (提示:n!=1×2×⋯×n;特别地,0!=1。) 输入 第一行一个整数T...原创 2020-03-09 10:57:27 · 246 阅读 · 0 评论 -
codeforces 1321 B. Journey Planning(贪心)
B. Journey Planning time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Tanya wants to go on a journey across the cities of Berland. ...原创 2020-03-02 12:39:00 · 292 阅读 · 0 评论 -
2020牛客寒假算法基础集训营4 E最小表达式(贪心 大数)
链接:https://ac.nowcoder.com/acm/contest/3005/E 来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 给出一个包含数字1-9和加号的字符串,请你将字符串中的字符任意排列,但每种字符数目不变,使得结果是一个合法的表达式,而且表达式...原创 2020-02-18 11:14:08 · 215 阅读 · 0 评论 -
CodeForces - 854C Planning(贪心 + 优先队列)
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the day...原创 2020-01-23 11:30:51 · 278 阅读 · 0 评论 -
HDU - 6514 Monitor (二维差分)
Xiaoteng has a large area of land for growing crops, and the land can be seen as a rectangle of n×mn×m . But recently Xiaoteng found that his crops were often stolen by a group of people, so he decide...原创 2020-01-23 10:44:42 · 495 阅读 · 0 评论 -
sdnu 1350.csad(差分+离散化)
Description woniuxia最近很不开心,所以他准备发泄一下,虽然这没什么,但是不巧的是,他准备拿你开刀,但是 你又不可能躲避。 那么题目来了: 给定n个区间,每个区间范围为[x,y]. 求最多的区间覆盖次数。 Input 多组测试数据。 n代表区间个数。1<=n<=300 接下来n行,x y 代表区间范围。0<=x Ou...原创 2019-12-12 20:06:50 · 216 阅读 · 0 评论 -
hdu 5139 Formula (离线)
Problem Description f(n)=(∏i=1nin−i+1)%1000000007 You are expected to write a program to calculate f(n) when a certain n is given. Input Multi test cases (about 100000), every case contains a...原创 2019-11-24 22:08:39 · 139 阅读 · 0 评论 -
HDU - 1556 Color the ball (差分裸题)
N个气球排成一排,从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了,你能帮他算出每个气球被涂过几次颜色吗? Input 每个测试实例第一行为一个整数N,(N <= 100000).接下来的N行,每行包括2个整数...原创 2019-09-05 20:43:03 · 671 阅读 · 0 评论 -
洛谷P1083 借教室(差分数组+二分)
题目描述 在大学期间,经常需要租借教室。大到院系举办活动,小到学习小组自习讨论,都需要向学校申请借教室。教室的大小功能不同,借教室人的身份不同,借教室的手续也不一样。 面对海量租借教室的信息,我们自然希望编程解决这个问题。 我们需要处理接下来nnn天的借教室信息,其中第iii天学校有rir_iri个教室可供租借。共有mmm份订单,每份订单用三个正整数描述,分别为dj,sj,tjd_j,s_...原创 2019-09-06 19:25:57 · 124 阅读 · 1 评论 -
zoj3699(贪心)
Dakar Rally Description The Dakar Rally is an annual Dakar Series rally raid type of off-road race, organized by the Amaury Sport Organization. The off-road endurance race consists of a series of rout...原创 2019-03-29 19:35:14 · 120 阅读 · 0 评论 -
zoj4090(贪心)
Thanks, TuSimple! In the very first sentence of the very first problem, we would like to give our sincere thanks to TuSimple, the sponsor of this contest. Founded in 2015, TuSimple is a global autonom...原创 2019-04-17 20:08:51 · 198 阅读 · 0 评论 -
HDU - 5056(尺取)
Boring count Problem Description You are given a string S consisting of lowercase letters, and your task is counting the number of substring that the number of each lowercase letter in the substring i...原创 2019-03-11 21:14:57 · 145 阅读 · 0 评论 -
sdnu1506 D.Swiss-system tournament(归并排序)
D.Swiss-system tournament Description A Swiss-system tournament is a tournament which uses a non-elimination format. The first tournament of this type was a chess tournament in Zurich in 1895, hence...原创 2019-07-25 16:30:28 · 167 阅读 · 0 评论