题意:
解法:
对于某一序列,最后一个数肯定不变,
对于倒数第二个数为x,倒数第一个数为v,
显然使得操作次数最少,数字个数为cnt=x/v+(x%v!=0).
在最少操作的前提下,显然最小的数字越大越好,因此将x均摊个cnt个数,最小的数为mi=x/cnt.
令d[i][j]表示从后往前到达第i个数,当前数最小值为j的最小操作次数和,
令c[i][j]表示从后往前到达第i个数,当前数最小值为j,的出现次数.
转移:
1:
分为cnt个数,那么需要操作(cnt-1)次,
d[i+1][x]出现c[i+1][x]次,因此新增操作次数为(cnt-1)*c[i+1][x].
d[i][mi]+=d[i+1][x]+(cnt-1)*c[i+1][x]
d[i][a[i]]+=0
2:
c[i][mi]+=c[i+1][x]
c[i][a[i]]+=1
对所有d[i][]求和就是答案.
由于第二维的数一定是x的因子,所以空间可以压为O(sq).
总复杂度O(n*sq),
注意点:
1.用map会超时,最后我手写的O(1)哈希.
2.不写滚动数组可能会超内存.
code:
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ST(x) x.begin()
#define ED(x) x.end()
#define RST(x) x.rbegin()
#define RED(x) x.end()
#define CL(x) x.clear();
#define all(a,n) a+1,a+1+n
#define ff(i,n) for(ll i=1;i<=n;i++)
#define rff(i,n) for(ll i=n;i>=1;i--)
#define fff(i,n) for(ll i=0;i<n;i++)
#define rfff(i,n) for(ll i=n-1;i>=0;i--)
#define SC(x) scanf("%s",x)
#define SL(x) strlen(x)
#define pss(a) push_back(a)
#define ps(a) push(a)
#define SZ(x) (int)x.size()
#define pee puts("");
#define eee putchar(' ');
#define re readdd()
#define pr(a) printtt(a)
int readdd(){int x=0,f=1;char c=getchar();
while(!isdigit(c)&&c!='-')c=getchar();
if(c=='-')f=-1,c=getchar();
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f*x;}
void printtt(int x){if(x<0)putchar('-'),x=-x;
if(x>=10)printtt(x/10);putchar(x%10+'0');}
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int ppow(int a,int b,int mod){a%=mod;
int ans=1%mod;while(b){if(b&1)ans=(long long)ans*a%mod;
a=(long long)a*a%mod;b>>=1;}return ans;}
bool addd(int a,int b){return a>b;}
int lowbit(int x){return x&-x;}
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};
bool isdigit(char c){return c>='0'&&c<='9';}
bool Isprime(int x){
for(int i=2;i*i<=x;i++)if(x%i==0)return 0;
return 1;
}
void ac(int x){if(x)puts("YES");else puts("NO");}
#define VE vector<int>
#define PI pair<int,int>
using namespace std;
const int mod=998244353;
const int maxm=1e5+5;
const int inv2=ppow(2,mod-2,mod);
int num[2][maxm],cur[2];
int mp[2][maxm];
int c[2][maxm];
int d[2][maxm];
int a[maxm];
int n;
int getid(int f,int x){
if(!mp[f][x]){
num[f][++cur[f]]=x;
mp[f][x]=cur[f];
}
return mp[f][x];
}
void init(int f){
for(int i=1;i<=cur[f];i++){
int x=num[f][i];
mp[f][x]=0;
c[f][i]=0;
d[f][i]=0;
}
cur[f]=0;
}
void solve(){
n=re;
ff(i,n)a[i]=re;
fff(i,2)init(i);
int now=0,pre=1;
d[pre][getid(pre,a[n])]=0;
c[pre][getid(pre,a[n])]=1;
int ans=0;
for(int i=n-1;i;i--){
init(now);
for(int j=1;j<=cur[pre];j++){
int v=num[pre][j],s=d[pre][j];
int cnt=a[i]/v+(a[i]%v!=0);
int x=a[i]/cnt;
int now_id=getid(now,x);
int &now_d=d[now][now_id];
int &now_c=c[now][now_id];
int &pre_c=c[pre][j];
now_d=(now_d+s+1ll*(cnt-1)*pre_c%mod)%mod;
now_c=(now_c+pre_c)%mod;
}
d[now][getid(now,a[i])]+=0;
c[now][getid(now,a[i])]+=1;
for(int j=1;j<=cur[now];j++){
int s=d[now][j];
ans=(ans+s)%mod;
}
swap(now,pre);
}
ans=(ans%mod+mod)%mod;
pr(ans);pee;
}
void Main(){
#define MULTI_CASE
#ifdef MULTI_CASE
int T;cin>>T;while(T--)
#endif
solve();
}
void Init(){
#ifdef SYNC_OFF
ios::sync_with_stdio(0);cin.tie(0);
#endif
#ifndef ONLINE_JUDGE
freopen("../in.txt","r",stdin);
freopen("../out.txt","w",stdout);
#endif
}
signed main(){
Init();
Main();
return 0;
}