Gee_Zer的博客

一开始以为可以用优先队列写，每次选择小费最多的，结果WA，正确的贪心思想是按照两个数的差排序，然后每次选择小费最多的即可。代码如下：#include<bits/stdc++.h>#define LL long long#define Max 100005#define Mod 1e9+7const LL mod=1e9+7;const LL inf=0x3f3f3f3f...

题目链接：154A题意：给你一个字符串，接下来给你n对字符，每对代表这两个字母有冲突不能相邻（一个字母只与不超过一个字母产生冲突），你可以删除某个字符来达到这个要求，现在问你最少需要删除多少个字符。思路：题目说了每个字母只与不超过一个字母产生冲突，所以可以知道n对字符串它们之间的解是独立的，接下来思考单独的一组，如果有连续的子字符串，全部由冲突字母构成，例如pg冲突，子字符串为pgppggg，...

C. Multi-Subject Competitiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA multi-subject competition is coming! The competition has m diff...

C. Phone Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnd where the are the phone numbers?You are given a string s consisting of l...

B. Minimize the errortime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two arrays A and B, each of size n. The error, E, between t...

C. Liebig’s Barrelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have m = n·k wooden staves. The i-th stave has length ai. You have to ...

Recently Monocarp got a job. His working day lasts exactly m minutes. During work, Monocarp wants to drink coffee at certain moments: there are n minutes a1,a2,…,an, when he is able and willing to tak...

B. Heaterstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVova’s house is an array consisting of n elements (yeah, this is the first problem, ...

题目链接：入门OJ3793Description有N棵小草，编号0至N-1。奶牛Bessie不喜欢小草，所以Bessie要用剪刀剪草，目标是使得这N棵小草的高度总和不超过H。在第0时刻，第i棵小草的高度是h[i]，接下来的每个整数时刻，会依次发生如下三个步骤：（1）每棵小草都长高了，第i棵小草长高的高度是grow[i]。（2）Bessie选择其中一棵小草并把它剪平，这棵小草高度变为0。...

题目链接：922DD. Robot Vacuum Cleanertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPushok the dog has been chasing Imp for a few hours already....