mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-13 17:50:45 +08:00
Major rework to improve code quality and add automation checks (#805)
* delete secant method - it is identical to regula falsi * document + improvize root finding algorithms * attempt to document gaussian elimination * added file brief * commented doxygen-mainpage, added files-list link * corrected files list link path * files-list link correction - this time works :) * document successive approximations * cleaner equation * updating DIRECTORY.md * documented kmp string search * document brute force string search * document rabin-karp string search * fixed mainpage readme * doxygen v1.8.18 will suppress out the #minipage in the markdown * cpplint correction for header guard style * github action to auto format source code per cpplint standard * updated setting to add 1 space before `private` and `public` keywords * auto rename files and auto format code * added missing "run" for step * corrected asignmemt operation * fixed trim and assign syntax * added git move for renaming bad filenames * added missing pipe for trim * added missing space * use old and new fnames * store old fname using echo * move files only if there is a change in filename * put old filenames in quotes * use double quote for old filename * escape double quotes * remove old_fname * try escape characters and echo" * add file-type to find * cleanup echo * ensure all trim variables are also in quotes * try escape -quote again * remove second escpe quote * use single quote for first check * use carets instead of quotes * put variables in brackets * remove -e from echo * add debug echos * try print0 flag * find command with while instead of for-loop * find command using IFS instead * 🎉 IFS fix worked - escaped quotes for git mv * protetc each word in git mv .. * filename exists in lower cases - renamed * 🎉 git push enabled * updating DIRECTORY.md * git pull & then push * formatting filenamesd7af6fdc8c* formatting source-code ford7af6fdc8c* remove allman break before braces * updating DIRECTORY.md * added missing comma lost in previous commit * orchestrate all workflows * fix yml indentation * force push format changes, add title to DIRECTORY.md * pull before proceeding * reorganize pull commands * use master branches for actions * rename .cc files to .cpp * added class destructor to clean up dynamic memory allocation * rename to awesome workflow * commented whole repo cpplint - added modified files lint check * removed need for cpplint * attempt to use actions/checkout@master * temporary: no dependency on cpplint * formatting filenames153fb7b8a5* formatting source-code for153fb7b8a5* updating DIRECTORY.md * fix diff filename * added comments to the code * added test case * formatting source-code fora850308fba* updating DIRECTORY.md * added machine learning folder * added adaline algorithm * updating DIRECTORY.md * fixed issue [LWG2192](https://cplusplus.github.io/LWG/issue2192) for std::abs on MacOS * add cmath for same bug: [LWG2192](https://cplusplus.github.io/LWG/issue2192) for std::abs on MacOS * formatting source-code forf8925e4822* use STL's inner_product * formatting source-code forf94a330594* added range comments * define activation function * use equal initial weights * change test2 function to predict * activation function not friend * previous commit correction * added option for predict function to return value before applying activation function as optional argument * added test case to classify points lying within a sphere * improve documentation for adaline * formatting source-code for15ec4c3aba* added cmake to geometry folder * added algorithm include for std::max * add namespace - machine_learning * add namespace - statistics * add namespace - sorting * added sorting algos to namespace sorting * added namespace string_search * formatting source-code forfd69530515* added documentation to string_search namespace * feat: Add BFS and DFS algorithms to check for cycle in a directed graph * Remove const references for input of simple types Reason: overhead on access * fix bad code sorry for force push * Use pointer instead of the non-const reference because apparently google says so. * Remove a useless and possibly bad Graph constuctor overload * Explicitely specify type of vector during graph instantiation * updating DIRECTORY.md * find openMP before adding subdirectories * added kohonen self organizing map * updating DIRECTORY.md * remove older files and folders from gh-pages before adding new files * remove chronos library due to inacceptability by cpplint * use c++ specific static_cast instead * initialize radom number generator * updated image links with those from CPP repository * rename computer.... folder to numerical methods * added durand kerner method for root computation for arbitrarily large polynomials * fixed additional comma * fix cpplint errors * updating DIRECTORY.md * convert to function module * update documentation * move openmp to main loop * added two test cases * use INT16_MAX * remove return statement from omp-for loop and use "break" * run tests when no input is provided and skip tests when input polynomial is provided * while loop cannot have break - replaced with continue and check is present in the main while condition * (1) break while loop (2) skip runs on break_loop instead of hard-break * add documentation images * use long double for errors and tolerance checks * make iterator variable i local to threads * add critical secions to omp threads * bugfix: move file writing outside of the parallel loop othersie, there is no gurantee of the order of roots written to file * rename folder to data_structures * updating DIRECTORY.md * fix ambiguous symbol `size` * add data_structures to cmake * docs: enable tree view, add timestamp in footer, try clang assistaed parsing * doxygen - open links in external window * remove invalid parameter from function docs * use HTML5 img tag to resize images * move file to proper folder * fix documentations and cpplint * formatting source-code foraacaf9828c* updating DIRECTORY.md * cpplint: add braces for multiple statement if * add explicit link to badges * remove duplicate line Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * remove namespace indentation * remove file associations in settings * add author name * enable cmake in subfolders of data_structures * create and link object file * cpp lint fixes and instantiate template classes * cpp lint fixes and instantiate template classes Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint - ignore `build/include` Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * disable redundant gcc compilation in cpplint workflow Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * template header files contain function codes as well and removed redundant subfolders Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md * remove semicolons after functions in a class Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint header guard style Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * remove semilon Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * added LU decomposition algorithm Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * added QR decomposition algorithm Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * use QR decomposition to find eigen values Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updating DIRECTORY.md * use std::rand for thread safety Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * move srand to main() Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * cpplint braces correction Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * updated eigen value documentation Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * fix matrix shift doc Signed-off-by: Krishna Vedala <7001608+kvedala@users.noreply.github.com> * rename CONTRIBUTION.md to CONTRIBUTING.md #836 * remove 'sort alphabetical order' check * added documentation check * remove extra paranthesis * added gitpod * added gitpod link from README * attempt to add vscode gitpod extensions * update gitpod extensions * add gitpod extensions cmake-tools and git-graph * remove gitpod init and add commands * use init to one time install doxygen, graphviz, cpplint * use gitpod dockerfile * add ninja build system to docker * remove configure task * add github prebuild specs to gitpod * disable gitpod addcommit * update documentation for kohonen_som * added ode solve using forward euler method * added mid-point euler ode solver * fixed itegration step equation * added semi-implicit euler ODE solver * updating DIRECTORY.md * fix cpplint issues - lines 117 and 124 * added documentation to ode group * corrected semi-implicit euler function * updated docs and test cases better structure * replace `free` with `delete` operator * formatting source-code forf55ab50cf2* updating DIRECTORY.md * main function must return * added machine learning group * added kohonen som topology algorithm * fix graph image path * updating DIRECTORY.md * fix braces * use snprintf instead of sprintf * use static_cast * hardcode character buffer size * fix machine learning groups in documentation * fix missing namespace function * replace kvedala fork references to TheAlgorithms * fix bug in counting_sort Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Anmol3299 <mittalanmol22@gmail.com>
This commit is contained in:
Krishna Vedala
@@ -1,77 +0,0 @@
|
||||
#include <iostream>
|
||||
using namespace std;
|
||||
const int N = 1e6 + 5;
|
||||
int a[N], bucket[N], cnt[N];
|
||||
int bucket_size;
|
||||
struct query
|
||||
{
|
||||
int l, r, i;
|
||||
} q[N];
|
||||
int ans = 0;
|
||||
|
||||
void add(int index)
|
||||
{
|
||||
cnt[a[index]]++;
|
||||
if (cnt[a[index]] == 1)
|
||||
ans++;
|
||||
}
|
||||
void remove(int index)
|
||||
{
|
||||
cnt[a[index]]--;
|
||||
if (cnt[a[index]] == 0)
|
||||
ans--;
|
||||
}
|
||||
|
||||
bool mycmp(query x, query y)
|
||||
{
|
||||
if (x.l / bucket_size != y.l / bucket_size)
|
||||
return x.l / bucket_size < y.l / bucket_size;
|
||||
return x.r < y.r;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
int n, t, i, j, k = 0;
|
||||
scanf("%d", &n);
|
||||
for (i = 0; i < n; i++)
|
||||
scanf("%d", &a[i]);
|
||||
bucket_size = ceil(sqrt(n));
|
||||
scanf("%d", &t);
|
||||
for (i = 0; i < t; i++)
|
||||
{
|
||||
scanf("%d %d", &q[i].l, &q[i].r);
|
||||
q[i].l--;
|
||||
q[i].r--;
|
||||
q[i].i = i;
|
||||
}
|
||||
sort(q, q + t, mycmp);
|
||||
int left = 0, right = 0;
|
||||
for (i = 0; i < t; i++)
|
||||
{
|
||||
int L = q[i].l, R = q[i].r;
|
||||
while (left < L)
|
||||
{
|
||||
remove(left);
|
||||
left++;
|
||||
}
|
||||
while (left > L)
|
||||
{
|
||||
add(left - 1);
|
||||
left--;
|
||||
}
|
||||
while (right <= R)
|
||||
{
|
||||
add(right);
|
||||
right++;
|
||||
}
|
||||
while (right > R + 1)
|
||||
{
|
||||
remove(right - 1);
|
||||
right--;
|
||||
}
|
||||
bucket[q[i].i] = ans;
|
||||
}
|
||||
for (i = 0; i < t; i++)
|
||||
printf("%d\n", bucket[i]);
|
||||
return 0;
|
||||
}
|
||||
@@ -3,66 +3,50 @@
|
||||
|
||||
using namespace std;
|
||||
|
||||
class Bit
|
||||
{
|
||||
class Bit {
|
||||
int n;
|
||||
vector<int> bit;
|
||||
inline int offset(int x)
|
||||
{
|
||||
return (x & (-x));
|
||||
}
|
||||
inline int offset(int x) { return (x & (-x)); }
|
||||
|
||||
public:
|
||||
|
||||
Bit(vector<int>& arr)
|
||||
{
|
||||
n = arr.size();
|
||||
bit.assign(n + 1, 0);
|
||||
for (int i = 0; i < n; ++i)
|
||||
{
|
||||
update(i, arr[i]);
|
||||
}
|
||||
public:
|
||||
Bit(vector<int>& arr) {
|
||||
n = arr.size();
|
||||
bit.assign(n + 1, 0);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
update(i, arr[i]);
|
||||
}
|
||||
Bit(int x)
|
||||
{
|
||||
}
|
||||
Bit(int x) {
|
||||
n = x;
|
||||
bit.assign(n + 1, 0);
|
||||
}
|
||||
|
||||
void update(int id, int val)
|
||||
{
|
||||
void update(int id, int val) {
|
||||
// Add val at id
|
||||
id++;
|
||||
while (id <= n)
|
||||
{
|
||||
while (id <= n) {
|
||||
bit[id] += val;
|
||||
id += offset(id);
|
||||
}
|
||||
}
|
||||
|
||||
int sum(int id)
|
||||
{
|
||||
int sum(int id) {
|
||||
// Get prefix sum upto id.
|
||||
id++;
|
||||
int res = 0;
|
||||
while (id > 0)
|
||||
{
|
||||
while (id > 0) {
|
||||
res += bit[id];
|
||||
id -= offset(id);
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
int sum_range(int l, int r)
|
||||
{
|
||||
return sum(r) - sum(l - 1);
|
||||
}
|
||||
int sum_range(int l, int r) { return sum(r) - sum(l - 1); }
|
||||
};
|
||||
|
||||
int main()
|
||||
{
|
||||
int main() {
|
||||
int n = 5;
|
||||
vector<int> arr = { 1, 2, 3, 4, 5 };
|
||||
vector<int> arr = {1, 2, 3, 4, 5};
|
||||
Bit x(arr);
|
||||
|
||||
assert(x.sum_range(0, 0) == 1);
|
||||
@@ -72,5 +56,5 @@ int main()
|
||||
assert(x.sum_range(0, 0) == 6);
|
||||
assert(x.sum_range(0, 1) == 8);
|
||||
assert(x.sum_range(0, 2) == 11);
|
||||
return 0;
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -1,4 +1,4 @@
|
||||
#include<iostream>
|
||||
#include <iostream>
|
||||
using namespace std;
|
||||
|
||||
/**
|
||||
@@ -6,43 +6,41 @@ using namespace std;
|
||||
* twos complement works good on this
|
||||
* also using ` x - (x & (x - 1)) `
|
||||
*/
|
||||
#define lowbit(x) (x & (-x) )
|
||||
#define lowbit(x) (x & (-x))
|
||||
|
||||
const int maxn = 1e5 + 7;
|
||||
int tree[maxn] = {0},
|
||||
range; // segement of [1...range], notice it must be less than `maxn`
|
||||
range; // segement of [1...range], notice it must be less than `maxn`
|
||||
|
||||
void update(int x, int c) {
|
||||
while(x <= range) {
|
||||
while (x <= range) {
|
||||
tree[x] += c;
|
||||
x += lowbit(x);
|
||||
}
|
||||
}
|
||||
int query(int x) {
|
||||
int ans = 0;
|
||||
while(x) {
|
||||
while (x) {
|
||||
ans += tree[x];
|
||||
x -= lowbit(x);
|
||||
}
|
||||
return ans;
|
||||
}
|
||||
int query_segement(int l, int r) {
|
||||
return query(r) - query(l - 1);
|
||||
}
|
||||
int query_segement(int l, int r) { return query(r) - query(l - 1); }
|
||||
|
||||
int main() {
|
||||
cin >> range;
|
||||
for(int i = 1; i <= range; i++) {
|
||||
for (int i = 1; i <= range; i++) {
|
||||
int num;
|
||||
cin >> num;
|
||||
update(i, num);
|
||||
}
|
||||
int q;
|
||||
cin >> q;
|
||||
while(q--) {
|
||||
while (q--) {
|
||||
int op;
|
||||
cin >> op;
|
||||
if(op == 0) {
|
||||
if (op == 0) {
|
||||
int l, r;
|
||||
cin >> l >> r;
|
||||
cout << query_segement(l, r) << endl;
|
||||
64
range_queries/mo.cpp
Normal file
64
range_queries/mo.cpp
Normal file
@@ -0,0 +1,64 @@
|
||||
#include <iostream>
|
||||
using namespace std;
|
||||
const int N = 1e6 + 5;
|
||||
int a[N], bucket[N], cnt[N];
|
||||
int bucket_size;
|
||||
struct query {
|
||||
int l, r, i;
|
||||
} q[N];
|
||||
int ans = 0;
|
||||
|
||||
void add(int index) {
|
||||
cnt[a[index]]++;
|
||||
if (cnt[a[index]] == 1)
|
||||
ans++;
|
||||
}
|
||||
void remove(int index) {
|
||||
cnt[a[index]]--;
|
||||
if (cnt[a[index]] == 0)
|
||||
ans--;
|
||||
}
|
||||
|
||||
bool mycmp(query x, query y) {
|
||||
if (x.l / bucket_size != y.l / bucket_size)
|
||||
return x.l / bucket_size < y.l / bucket_size;
|
||||
return x.r < y.r;
|
||||
}
|
||||
|
||||
int main() {
|
||||
int n, t, i, j, k = 0;
|
||||
scanf("%d", &n);
|
||||
for (i = 0; i < n; i++) scanf("%d", &a[i]);
|
||||
bucket_size = ceil(sqrt(n));
|
||||
scanf("%d", &t);
|
||||
for (i = 0; i < t; i++) {
|
||||
scanf("%d %d", &q[i].l, &q[i].r);
|
||||
q[i].l--;
|
||||
q[i].r--;
|
||||
q[i].i = i;
|
||||
}
|
||||
sort(q, q + t, mycmp);
|
||||
int left = 0, right = 0;
|
||||
for (i = 0; i < t; i++) {
|
||||
int L = q[i].l, R = q[i].r;
|
||||
while (left < L) {
|
||||
remove(left);
|
||||
left++;
|
||||
}
|
||||
while (left > L) {
|
||||
add(left - 1);
|
||||
left--;
|
||||
}
|
||||
while (right <= R) {
|
||||
add(right);
|
||||
right++;
|
||||
}
|
||||
while (right > R + 1) {
|
||||
remove(right - 1);
|
||||
right--;
|
||||
}
|
||||
bucket[q[i].i] = ans;
|
||||
}
|
||||
for (i = 0; i < t; i++) printf("%d\n", bucket[i]);
|
||||
return 0;
|
||||
}
|
||||
@@ -1,92 +0,0 @@
|
||||
//#include <bits/stdc++.h>
|
||||
#incldue <iostream>
|
||||
#define MAX 4000000
|
||||
using namespace std;
|
||||
typedef long long ll;
|
||||
void ConsTree(ll arr[], ll segtree[], ll low, ll high, ll pos)
|
||||
{
|
||||
if (low == high)
|
||||
{
|
||||
segtree[pos] = arr[low];
|
||||
return;
|
||||
}
|
||||
ll mid = (low + high) / 2;
|
||||
ConsTree(arr, segtree, low, mid, 2 * pos + 1);
|
||||
ConsTree(arr, segtree, mid + 1, high, 2 * pos + 2);
|
||||
segtree[pos] = segtree[2 * pos + 1] + segtree[2 * pos + 2];
|
||||
}
|
||||
ll query(ll segtree[], ll lazy[], ll qlow, ll qhigh, ll low, ll high, ll pos)
|
||||
{
|
||||
if (low > high)
|
||||
return 0;
|
||||
if (qlow > high || qhigh < low)
|
||||
return 0;
|
||||
if (lazy[pos] != 0)
|
||||
{
|
||||
segtree[pos] += lazy[pos] * (high - low + 1);
|
||||
if (low != high)
|
||||
{
|
||||
lazy[2 * pos + 1] += lazy[pos];
|
||||
lazy[2 * pos + 2] += lazy[pos];
|
||||
}
|
||||
lazy[pos] = 0;
|
||||
}
|
||||
if (qlow <= low && qhigh >= high)
|
||||
return segtree[pos];
|
||||
ll mid = (low + high) / 2;
|
||||
return query(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) + query(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);
|
||||
}
|
||||
void update(ll segtree[], ll lazy[], ll start, ll end, ll delta, ll low, ll high, ll pos)
|
||||
{
|
||||
if (low > high)
|
||||
return;
|
||||
if (lazy[pos] != 0)
|
||||
{
|
||||
segtree[pos] += lazy[pos] * (high - low + 1);
|
||||
if (low != high)
|
||||
{
|
||||
lazy[2 * pos + 1] += lazy[pos];
|
||||
lazy[2 * pos + 2] += lazy[pos];
|
||||
}
|
||||
lazy[pos] = 0;
|
||||
}
|
||||
if (start > high || end < low)
|
||||
return;
|
||||
if (start <= low && end >= high)
|
||||
{
|
||||
segtree[pos] += delta * (high - low + 1);
|
||||
if (low != high)
|
||||
{
|
||||
lazy[2 * pos + 1] += delta;
|
||||
lazy[2 * pos + 2] += delta;
|
||||
}
|
||||
return;
|
||||
}
|
||||
ll mid = (low + high) / 2;
|
||||
update(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);
|
||||
update(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);
|
||||
segtree[pos] = segtree[2 * pos + 1] + segtree[2 * pos + 2];
|
||||
}
|
||||
int main()
|
||||
{
|
||||
ll n, c;
|
||||
scanf("%lld %lld", &n, &c);
|
||||
ll arr[n] = {0}, p, q, v, choice;
|
||||
ll segtree[MAX], lazy[MAX] = {0};
|
||||
ConsTree(arr, segtree, 0, n - 1, 0);
|
||||
while (c--)
|
||||
{
|
||||
scanf("%lld", &choice);
|
||||
if (choice == 0)
|
||||
{
|
||||
scanf("%lld %lld %lld", &p, &q, &v);
|
||||
update(segtree, lazy, p - 1, q - 1, v, 0, n - 1, 0);
|
||||
}
|
||||
else
|
||||
{
|
||||
scanf("%lld %lld", &p, &q);
|
||||
printf("%lld\n", query(segtree, lazy, p - 1, q - 1, 0, n - 1, 0));
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
79
range_queries/segtree.cpp
Normal file
79
range_queries/segtree.cpp
Normal file
@@ -0,0 +1,79 @@
|
||||
//#include <bits/stdc++.h>
|
||||
#incldue < iostream >
|
||||
#define MAX 4000000
|
||||
using namespace std;
|
||||
typedef long long ll;
|
||||
void ConsTree(ll arr[], ll segtree[], ll low, ll high, ll pos) {
|
||||
if (low == high) {
|
||||
segtree[pos] = arr[low];
|
||||
return;
|
||||
}
|
||||
ll mid = (low + high) / 2;
|
||||
ConsTree(arr, segtree, low, mid, 2 * pos + 1);
|
||||
ConsTree(arr, segtree, mid + 1, high, 2 * pos + 2);
|
||||
segtree[pos] = segtree[2 * pos + 1] + segtree[2 * pos + 2];
|
||||
}
|
||||
ll query(ll segtree[], ll lazy[], ll qlow, ll qhigh, ll low, ll high, ll pos) {
|
||||
if (low > high)
|
||||
return 0;
|
||||
if (qlow > high || qhigh < low)
|
||||
return 0;
|
||||
if (lazy[pos] != 0) {
|
||||
segtree[pos] += lazy[pos] * (high - low + 1);
|
||||
if (low != high) {
|
||||
lazy[2 * pos + 1] += lazy[pos];
|
||||
lazy[2 * pos + 2] += lazy[pos];
|
||||
}
|
||||
lazy[pos] = 0;
|
||||
}
|
||||
if (qlow <= low && qhigh >= high)
|
||||
return segtree[pos];
|
||||
ll mid = (low + high) / 2;
|
||||
return query(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +
|
||||
query(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);
|
||||
}
|
||||
void update(ll segtree[], ll lazy[], ll start, ll end, ll delta, ll low,
|
||||
ll high, ll pos) {
|
||||
if (low > high)
|
||||
return;
|
||||
if (lazy[pos] != 0) {
|
||||
segtree[pos] += lazy[pos] * (high - low + 1);
|
||||
if (low != high) {
|
||||
lazy[2 * pos + 1] += lazy[pos];
|
||||
lazy[2 * pos + 2] += lazy[pos];
|
||||
}
|
||||
lazy[pos] = 0;
|
||||
}
|
||||
if (start > high || end < low)
|
||||
return;
|
||||
if (start <= low && end >= high) {
|
||||
segtree[pos] += delta * (high - low + 1);
|
||||
if (low != high) {
|
||||
lazy[2 * pos + 1] += delta;
|
||||
lazy[2 * pos + 2] += delta;
|
||||
}
|
||||
return;
|
||||
}
|
||||
ll mid = (low + high) / 2;
|
||||
update(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);
|
||||
update(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);
|
||||
segtree[pos] = segtree[2 * pos + 1] + segtree[2 * pos + 2];
|
||||
}
|
||||
int main() {
|
||||
ll n, c;
|
||||
scanf("%lld %lld", &n, &c);
|
||||
ll arr[n] = {0}, p, q, v, choice;
|
||||
ll segtree[MAX], lazy[MAX] = {0};
|
||||
ConsTree(arr, segtree, 0, n - 1, 0);
|
||||
while (c--) {
|
||||
scanf("%lld", &choice);
|
||||
if (choice == 0) {
|
||||
scanf("%lld %lld %lld", &p, &q, &v);
|
||||
update(segtree, lazy, p - 1, q - 1, v, 0, n - 1, 0);
|
||||
} else {
|
||||
scanf("%lld %lld", &p, &q);
|
||||
printf("%lld\n", query(segtree, lazy, p - 1, q - 1, 0, n - 1, 0));
|
||||
}
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user