Planting
Planting poplar threes—the application of a Chinese way to control soil cadmium pollution in Japan
Situations of soil cadmium pollution in Japan In the last century, there was a serious health accident in Japan, an outbreak of Itai-itai disease, whi ......
Planting Trees and Glasses--- Holding Back Soil Erosion
Planting trees and glasses 植树种草 Ganzhou, a typical red soil hilly area in Jiangxi province, is a pilot area for high-quality development of soil and w ......
[CF444E] DZY Loves Planting
DZY Loves Planting 逆天题。 想到二分,判断用网络流,但是好像 n 有点大。 我们想尽量让每个点的 g 能大于下界,所以我们尽量往大的边走,其实就是尽量不走小的边。 所以考虑将边从小到大排序,每次合并两端的连通块,如果剩下点的 x 总和小于总点数就只能内部消化。 又因为这已经是最劣 ......
洛谷P3038 [USACO11DEC] Grass Planting G 题解 树链剖分
题目链接：[https://www.luogu.com.cn/problem/P3038](https://www.luogu.com.cn/problem/P3038) 题目大意： 一棵树维护两种操作： 1. 一条路径上每条边边权 $+1$； 2. 查询路径上的边权和。 解题思路： 树链剖分模板题 ......
NC24141 [USACO 2011 Dec G]Grass Planting
[题目链接](https://ac.nowcoder.com/acm/problem/24141) # 题目 **题目描述** Farmer John has N barren pastures (2 using namespace std; using ll = long long; struct ......
[LeetCode] 1042. Flower Planting With No Adjacent
You have n gardens, labeled from 1 to n, and an array paths where paths[i] = [xi, yi] describes a bidirectional path between garden xi to garden yi. I ......
Planting Trees (双指针+ 单调队列优化处理)
题目大意: 给出一个矩阵, 和M ,找到一个最大的子矩阵,使得里面的最大值-最小值的差值小于 M 思路: 关键信息是最大和最小, 就保留这个信息即可 然后考虑如何枚举每一个矩阵? 枚举矩阵的上下边界, 然后在考虑矩阵的左右边界, 左右边界处理的时候, 这一列的最大最小值,可以通过枚举上下边界的时候线 ......