贪心
文章平均质量分 63
white_156
星河滚烫,烫死人间理想;
皓月星辰 冻死人间曙光
展开
-
codeforce1368D. AND, OR and square sum
問題は予想よりも簡単です#pragma GCC diagnostic error "-std=c++11"#include <bits/stdc++.h>#define INF 0x3f3f3f3f#define ll long long#define Pair pair<int,int>#define re return#define getLen(name,index) name[index].size()#define mem(a,b) memset(a,b原创 2020-06-27 15:45:13 · 203 阅读 · 0 评论 -
codeforce1366C. Palindromic Paths
题目链接给一个NXM的0-1矩阵,需要从(1,1)走到(n,m),每次只能向右或者向下走。求最少改动几次矩阵中数据,使得所有路径都是回文路径(路径上关于中心对称位置上数字一样)这是一个需要对数据预处理然后贪心的水题。对于所有路径来说,距离起点任意确定距离的点是又穷可枚举的。所以若使得所有路径均为回文路径,只需将对称位置点全部替换成1或0即可#pragma GCC diagnostic error "-std=c++11"#include <bits/stdc++.h>#define原创 2020-06-16 23:48:04 · 294 阅读 · 1 评论 -
Codeforces 1304C. Air Conditioner
题目连接: 我怎么又被挤出红莲了G有个餐厅,里面有个空调。这个空调有三个功能:off 保持将保持餐厅的温度不变heatin 加热在1分钟内将餐厅的温度提高一度cooling 制冷在1分钟内将餐厅的温度降低一度来G餐厅的每个客人都有其自己觉得爽的温度区间,只要在他进门的一刻,餐厅的温度在他的温度区间内,那他就觉得爽。现在G想知道能不能让所有人都爽这个题其实就是问...原创 2020-02-17 20:26:24 · 438 阅读 · 0 评论 -
codeforcs1165E. Two Arrays and Sum of Functions 贪心
题目链接 琪亚娜世界第一可爱给出两个数组,对数组B重新排序,记数组C[i]=A[i]*B[i],求C所有子区间的和的最小值。给定区间长度,C中元素对答案的贡献只与位置有关,也就是对于位置i来说,在后续的计算中,这个元素出现的次数只与位置有关。所以可以提前计算出现的次数num[i],并记C[i]=A[i]*num[i],找C中最大的元素和B中最小的元素相乘就是答案。由于计算最小的值,而不...原创 2019-05-17 14:45:20 · 410 阅读 · 0 评论 -
codeforces553D. Stas and the Queue at the Buffet 贪心
题目传送门 ┗|`O′|┛ 嗷~~ 求最小值∑i=1N(ai⋅(j−1)+bi⋅(N−j))\sum_{i=1}^{N}(a_i⋅(j-1)+b_i⋅(N-j))i=1∑N(ai⋅(j−1)+bi⋅(N−j))#include <stdio.h>#include <climits>#include <cstring>#include <...原创 2019-04-24 14:07:21 · 131 阅读 · 0 评论 -
codeforces1119B. Alyona and a Narrow Fridge 贪心
神奇的传送门 现在给了一个冰箱,有两格宽,H格高,还有N瓶牛奶,每个牛奶都有一个高度,求最多能放进前几个瓶子二分枚举,贪心验证。当前这些瓶子中,最高的能放下,这组序列才有可能放下#include <stdio.h>#include <climits>#include <cstring>#include <time.h>#inclu...原创 2019-04-18 12:27:31 · 217 阅读 · 0 评论 -
codeforces1144D Equalize Them All 贪心
You are given an array a consisting of n integers. You can perform the following operations arbitrary number of times (possibly, zero):Choose a pair of indices (i,j)such that |i−j|=1 (indices i and ...原创 2019-04-19 21:04:08 · 160 阅读 · 0 评论 -
ZOJ3953 Intervals 贪心
Chiaki has n intervals and the i-th of them is [li, rj]. She wants to delete some intervals so that there does not exist three intervals a, b and c such that a intersects with b, b intersects with c a...原创 2019-04-12 20:51:47 · 155 阅读 · 0 评论 -
codeforces1153D. Serval and Rooted Tree 贪心
题目传送门: 戳这里 每个叶节点任意赋值,根据节点的特性求根节点的最大值对于任意一个节点,如果使他的子节点都尽量大,那么该节点的值就是最大的。每个节点记当前的最大值,是1-k中的第几大值,根据max和min的特性推算#include <stdio.h>#include <climits>#include <cstring>#include &l...原创 2019-04-16 03:24:26 · 200 阅读 · 0 评论 -
codeforces547B. Jamie and Binary Sequence (changed after round)
Jamie is preparing a Codeforces round. He has got an idea for a problem, but does not know how to solve it. Help him write a solution to the following problem:Find k integers such that the sum of two...原创 2019-04-07 13:49:48 · 194 阅读 · 0 评论 -
贪心算法
当前最优解导致全局的最优解,且一旦做出选择则不能更改。每次考虑一个输入,针对每个输入,选择当前的最优解。参考去年从图书馆里借的一本书,忘了叫什么了,这里好多代码都是从那本书上抄的,过几天去看看再补上。算法设计1、将优化问题转化为:先做出选择,再解决剩下的子问题2、证明原问题总是有一个最优解是贪心选择得到的,从而说明贪心选择的安全。即利用数学归纳法或反证法证明按照贪心操作,在可行解中不可能存...原创 2019-04-06 12:25:08 · 331 阅读 · 0 评论 -
codeforces538B.Yet Another Array Partitioning Task
An array b is called to be a subarray of a if it forms a continuous subsequence of a, that is, if it is equal to al, al+1, …, ar for some l,r.Suppose m is some known constant. For any array, having m...原创 2019-02-17 16:25:06 · 341 阅读 · 0 评论 -
codeforces 1043ETrain Hard, Win Easy
Zibi is a competitive programming coach. There are n competitors who want to be prepared well. The training contests are quite unusual – there are two people in a team, two problems, and each competit...原创 2018-11-29 00:22:31 · 193 阅读 · 0 评论 -
leetcode 738. Monotone Increasing Digits
Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.(Recall that an integer has monotone increasing digits if and only if each pair...原创 2018-10-17 08:42:26 · 207 阅读 · 0 评论 -
letcode 714. Best Time to Buy and Sell Stock with Transaction Fee
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.You may complete as many t...原创 2018-10-13 14:20:28 · 241 阅读 · 0 评论 -
leetcode 861. Score After Flipping Matrix
We have a two dimensional matrix A where each value is 0 or 1.A move consists of choosing any row or column, and toggling each value in that row or column: changing all 0s to 1s, and all 1s to 0s.Af...原创 2018-10-12 21:46:30 · 148 阅读 · 0 评论 -
765. Couples Holding Hands
N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people...原创 2018-10-11 21:33:57 · 124 阅读 · 0 评论