weixin_43902655的博客

Polycarp is a head of a circus troupe. There are n — an even number — artists in the troupe. It is known whether the i-th artist can perform as a clown (if yes, then ci=1, otherwise ci=0), and whether they can perform as an acrobat (if yes, then ai=1, othe

给定一个数组A，对其进行q次操作，每次给定l、r，对A【l-r】区间内所有数增加x，最后输出修改后每个数的值。前缀和+差分处理，时间复杂度O(n+q)。#include<iostream>#include<string>#include<cstring>#include<algorithm>using namespace std;int a[100010];//原数组 int d[100010];//差分数组 int sum[100010];