题意:
pot(a[i]) 的定义: 找出一个m使得pm可以整除a[i]而pm+1不能整除a[i]
给定一个长度为n的数组,初始全为1.然后有两种操作:
操作1:给区间l-r的数乘上x
操作2:询问区间l-r最大的pot(a[i])
思路:
要使得m最大,那p肯定得尽量小了,由于题目只会乘2-10的数,那么就可以保证这些数一定可以被2,3,5,7中的某一个数整除。
建立4棵线段树,分别维护p为2,3,5,7时的m。
查询的时候输出最大的那个m就行了。
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n,m) printf("%d %d", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n,m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sc(n) scanf("%c",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define mem(a,n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mod(x) ((x)%MOD)
#define gcd(a,b) __gcd(a,b)
#define lowbit(x) (x&-x)
#define rtl rt<<1
#define rtr rt<<1|1
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
int ret = 0, sgn = 1;
char ch = getchar();
while(ch < '0' || ch > '9')
{
if(ch == '-')
sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
ret = ret*10 + ch - '0';
ch = getchar();
}
return ret*sgn;
}
inline void Out(int a)
{
if(a>9) Out(a/10);
putchar(a%10+'0');
}
int qpow(int m, int k, int mod)
{
int res = 1, t = m;
while (k)
{
if (k&1)
res = res * t % mod;
t = t * t % mod;
k >>= 1;
}
return res;
}
ll gcd(ll a,ll b){return b==0?a : gcd(b,a%b);}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
ll inv(ll x,ll m){return qpow(x,m-2,m)%m;}
const int N = 8e5+10;
struct node{
int l,r;
int val;
int maxx;
int lazy;
}tr2[N],tr3[N],tr5[N],tr7[N];
void update(node a[],int rt)
{
a[rt].maxx = max(a[rtl].maxx,a[rtr].maxx);
}
void build(node a[],int rt,int l,int r)
{
a[rt].l = l;
a[rt].r = r;
a[rt].lazy = a[rt].maxx = 0;
if(l == r) return;
int mid = (l+r)>>1;
build(a,rtl,l,mid);
build(a,rtr,mid+1,r);
update(a,rt);
}
void push_down(node a[],int rt)
{
if(a[rt].l == a[rt].r)
{
a[rt].lazy = 0;
return ;
}
a[rtl].maxx += a[rt].lazy;
a[rtr].maxx += a[rt].lazy;
a[rtl].lazy += a[rt].lazy;
a[rtr].lazy += a[rt].lazy;
a[rt].lazy = 0;
}
void add(node a[],int rt,int l,int r,int x)
{
if(a[rt].l == l && a[rt].r == r)
{
a[rt].maxx += x;
a[rt].lazy += x;
return;
}
int mid = (a[rt].l+a[rt].r)>>1;
if(a[rt].lazy)
push_down(a,rt);
if(r <= mid)
add(a,rtl,l,r,x);
else if(l > mid)
add(a,rtr,l,r,x);
else
{
add(a,rtl,l,mid,x);
add(a,rtr,mid+1,r,x);
}
update(a,rt);
}
int query(node a[],int rt,int l,int r)
{
if(a[rt].lazy)
push_down(a,rt);
if(l == a[rt].l && r == a[rt].r)
{
return a[rt].maxx;
}
int mid = (a[rt].l+a[rt].r)>>1;
if(r <= mid)
return query(a,rtl,l,r);
if(l > mid)
return query(a,rtr,l,r);
return max(query(a,rtl,l,mid),query(a,rtr,mid+1,r));
}
signed main()
{
int n,q;
cin>>n;
build(tr2,1,1,n);
build(tr3,1,1,n);
build(tr5,1,1,n);
build(tr7,1,1,n);
cin>>q;
while(q--)
{
string s;
int l,r,x;
cin>>s>>l>>r;
if(s[1] == 'U')
{
cin>>x;
switch(x)
{
case 2:add(tr2,1,l,r,1);break;
case 3:add(tr3,1,l,r,1);break;
case 4:add(tr2,1,l,r,2);break;
case 5:add(tr5,1,l,r,1);break;
case 6:add(tr2,1,l,r,1);add(tr3,1,l,r,1);break;
case 7:add(tr7,1,l,r,1);break;
case 8:add(tr2,1,l,r,3);break;
case 9:add(tr3,1,l,r,2);break;
case 10:add(tr2,1,l,r,1);add(tr5,1,l,r,1);break;
}
}
else
{
cout<<"ANSWER ";
int tt1 = max(query(tr2,1,l,r),query(tr3,1,l,r));
int tt2 = max(query(tr5,1,l,r),query(tr7,1,l,r));
cout<<max(tt1,tt2)<<endl;
}
}
}