![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
KEIke0
这个作者很懒,什么都没留下…
展开
-
I Hate It HDU 1754
#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int MAXN=201000;int t[MAXN<<2];int n,m;void pushup(int rt){ t[rt]=max(t[rt<<...原创 2020-03-08 19:32:36 · 106 阅读 · 0 评论 -
A Simple Problem with Integers POJ 3468
线段树抄的博客#include<cstdio>#include<algorithm>#include<iostream>using namespace std;const int MAXN=100000;int num[MAXN];struct Node{ int l,r;//区间的左右端点long long nSum;//区...原创 2020-03-08 15:44:28 · 112 阅读 · 0 评论 -
Crane POJ 2991
需再看几次#include <cstdio>#include <cmath>const int ST_SIZE = (1 << 15) - 1;const int MAX_N = 10001;const int MAX_C = 10001;const double PI = 3.14159265;int N, C;int L[MAX_N];...原创 2020-02-26 11:00:15 · 155 阅读 · 0 评论