F - SUM and REPLACE(线段树)

最新推荐文章于 2024-08-28 21:25:50 发布

q619718

最新推荐文章于 2024-08-28 21:25:50 发布

阅读量295

点赞数

文章标签：算法 c++

本文链接：https://blog.csdn.net/q619718/article/details/129947857

版权

文章描述了一个编程问题，涉及对数组执行两种类型的查询：替换（将区间内所有元素替换为其正因子个数）和求和。线段树数据结构被用来高效地处理这些查询，同时维护区间内的最大值，因为每个元素在经过六次替换后会变成1或2。代码示例展示了如何构建和操作线段树来解决这个问题。

摘要由CSDN通过智能技术生成

Let D(x) be the number of positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by 1 and 2), D(6) = 4 (6 is divisible by 1, 2, 3 and 6).

You are given an array a of n integers. You have to process two types of queries:

REPLACE l r — for every
replace ai with D(ai);
SUM l r — calculate
.

Print the answer for each SUM query.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 3·105) — the number of elements in the array and the number of queries to process, respectively.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the elements of the array.

Then m lines follow, each containing 3 integers ti, li, ri denoting i-th query. If ti = 1, then i-th query is REPLACE li ri, otherwise it's SUM li ri (1 ≤ ti ≤ 2, 1 ≤ li ≤ ri ≤ n).

There is at least one SUM query.

Output

For each SUM query print the answer to it.

Sample 1
Inputcopy Outputcopy
7 6
6 4 1 10 3 2 4
2 1 7
2 4 5
1 3 5
2 4 4
1 5 7
2 1 7
30
13
4
22

Inputcopy	Outputcopy
7 6 6 4 1 10 3 2 4 2 1 7 2 4 5 1 3 5 2 4 4 1 5 7 2 1 7	30 13 4 22

线段树维护,每个值经过六次变化后就会是1或者2,所以再维护一个最大值就可以了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
using namespace std;
#define int long long
typedef pair<int,int>PII;
constexpr int N=1e6+7;
int n,m,a[N];

struct node{
    int l,r;
    int sum;
    int maxx;
}tr[N*4];
int d[N];
void pushup(int u){
    tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum;
    tr[u].maxx=max(tr[u<<1|1].maxx,tr[u<<1].maxx);
}
void build(int u,int l,int r){
    tr[u].l=l,tr[u].r=r;
    if(tr[u].l==tr[u].r){
        tr[u]={l,r,a[l],a[l]};
        return;
    }
    int mid=(tr[u].l+tr[u].r)>>1;
    build(u<<1,l,mid);
    build(u<<1|1,mid+1,r);
    pushup(u);
}
void modify(int u,int l,int r){
    if(tr[u].maxx<=2) return;
    if(tr[u].l==tr[u].r){
        tr[u].sum=tr[u].maxx= d[tr[u].sum];
        return;
    }
    int mid=(tr[u].l+tr[u].r)>>1;
    if(l<=mid) modify(u<<1 , l , r);
    if(r>mid) modify(u<<1|1 , l , r );
    pushup(u);

}
int query(int u,int l,int r) {
    if (l <= tr[u].l && r >= tr[u].r) return tr[u].sum;
    int res = 0;
    int mid = tr[u].l + tr[u].r >> 1;
    if (l <= mid) res += query(u << 1, l, r);
    if (r > mid) res += query(u << 1 | 1, l, r);
    return res;
}
signed main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    for(int i=1;i<=1000000;i++)
    {
        for(int j=i;j<=1000000;j+=i) {
            d[j]++;
        }
    }
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    build(1,1,n);
    while(m--){
        int op,l,r;
        cin>>op>>l>>r;
        if(op==1){
            modify(1,l,r);
        }
        else{
            cout<<query(1,l,r)<<endl;
        }
    }
    return 0;
}