CF1928D Lonely Mountain Dungeons
1.P6411 [COCI2008-2009#3] MATRICA2.AT_tenka1_2014_final_d 高橋君3.CF963D Frequency of String4.P4465 [国家集训队] JZPSTR5.P9816 少项式复合幂6.P9817 lmxcslD7.P9821 [ICPC2020 Shanghai R] Sum of Log8.AT_agc034_e Complete Compress9.CF1381D The Majestic Brown Tree Snake10.CF1914F Programming Competition11.P10033 「Cfz Round 3」Sum of Permutation12.AT_abc337_g Tree Inversion13.P10060 [SNOI2024] 树 V 图14.P10061 [SNOI2024] 矩阵15.AT_arc170_d Triangle Card Game16.AT_arc170_c Prefix Mex Sequence17.CF1928C Physical Education Lesson
18.CF1928D Lonely Mountain Dungeons
19.CF1928E Modular Sequence20.CF1634D Finding Zero21.P3756 [CQOI2017] 老C的方块22.P6765 [APIO2020] 交换城市23.P3270 [JLOI2016] 成绩比较24.P5102 [JOI 2016 Final] 领地25.AT_arc148_e ≥ K26.CF1039D You Are Given a Tree27.AT_abc374_f Shipping28.CF2021E3 Digital Village (Extreme Version)29.CF2021D Boss, Thirsty30.CF1876G Clubstep31.P11592 [NordicOI 2024] Chair Game设
设
设
#include<stdio.h>
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
const int MAXN=2e5+10;
int T,n,b,z,c[MAXN],f[MAXN],MAX,ans;
inline int F(int x,int y)
{
int p=x/y,q=x%y;
return x*(x+1)/2-(y-q)*p*(p+1)/2-q*(p+1)*(p+2)/2;
}
inline void work()
{
cin>>n>>b>>z;
for(int i=1;i<=n;++i)
{
cin>>c[i];MAX=max(MAX,c[i]);
for(int j=1;j<c[i];++j)
{
int cur=F(c[i],j)*b;
f[j]+=cur,f[j+1]-=cur;
}
f[c[i]]+=F(c[i],c[i])*b;
}
for(int i=1;i<=MAX;++i)
f[i]+=f[i-1],ans=max(ans,f[i]-(i-1)*z);
for(int i=1;i<=MAX;++i) f[i]=0;
cout<<ans<<'\n';MAX=ans=0;return ;
}
signed main()
{
cin.tie(0),cout.tie(0);
ios::sync_with_stdio(0);
cin>>T;while(T--) work();
return 0;
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 地球OL攻略 —— 某应届生求职总结
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 提示词工程——AI应用必不可少的技术
· .NET周刊【3月第1期 2025-03-02】