一、内容题意:给定一个序列1—N，给定几组区间，每个区间进行涂色，问最后每个点被涂了几次。二、思路差分数组这里使用线段树lazy标记。查询的时候查询到每个单点。三、代码#include <cstdio>#include <cstring>typedef long long ll;const int maxn = 1e5 + 5;int n, x, y...
一、内容
题意:给定一个序列1—N，给定几组区间，每个区间进行涂色，问最后每个点被涂了几次。
二、思路
差分数组
这里使用线段树lazy标记。查询的时候查询到每个单点。
三、代码
#include <cstdio>
#include <cstring>
typedef long long ll;
const int maxn = 1e5 + 5;
int n, x, y...
题意：一个序列初始都是1，然后操作x y a把区间[x,y]改为a，m次操作后问序列总值。 题解：线段树区间修改水题。#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 100005;int n, m, sum[N << 2], addv[N << 2], l1,
题意 解析 代码 #include<bits/stdc++.h> using namespace std; #define ll long long const int INF = 0x3f3f3f3f,N = 1e6+10; ll c[2][N]; int n,q; int tmp; void u ...
一、内容World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you have to correctly answer the evil questions of Dr. Horr...
一、内容World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you have to correctly answer the evil questions of Dr. Horr...
题意 解析 代码 #include<bits/stdc++.h> using namespace std; #define ll long long const int INF = 0x3f3f3f3f,N = 1e6+10; ll c[2][N]; int n,q; int tmp; void u ...
