除了暴力就是板子 个人还觉得E 是个错题 建议大家没事多去div3休息
A.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=4e4+10,M=1e6+10;
int vis[30],mp[N];
ll f[N];
void solve(){
string s;cin>>s;
if(s[0]+s[1]+s[2]==s[3]+s[4]+s[5])cout<<"YES\n";
else cout<<"NO\n";
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
B.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=4e4+10,M=1e6+10;
int vis[30],mp[N];
ll f[N];
void solve(){
int n;cin>>n;int sum=0,minn=INF;
for(int i=1;i<=n;i++){
int x;cin>>x;
sum+=x;minn=min(minn,x);
}
cout<<sum-minn*n<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
C.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1e5+10,M=1e6+10;
int vis[30],mp[N];
ll f[N];string s[N];
void solve(){
int n,m;cin>>n>>m;
int minn=INF;
for(int i=1;i<=n;i++)cin>>s[i];
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
int cnt=0;
for(int k=0;k<m;k++){
cnt+=abs(s[i][k]-s[j][k]);
}
minn=min(minn,cnt);
}
}
cout<<minn<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
D .
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1e5+10,M=1e6+10;
int vis[30],mp[N];
int n,m,a[210][210];
bool go(int x,int y){
return x>=1&&x<=n&&y>=1&&y<=m;
}
void solve(){
cin>>n>>m;int maxx=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)cin>>a[i][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
int cnt=0;
for(int k=1;k<=max(n,m);k++){
if(go(i+k,j+k))cnt+=a[i+k][j+k];
if(go(i+k,j-k))cnt+=a[i+k][j-k];
if(go(i-k,j+k))cnt+=a[i-k][j+k];
if(go(i-k,j-k))cnt+=a[i-k][j-k];
}
maxx=max(maxx,cnt+a[i][j]);
}
}
cout<<maxx<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
E.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1.5e5+10,M=1e6+10;
int vis[30],mp[N];
int n,q,d[N],a[N];
void solve(){
cin>>n>>q;mem(d,0);
for(int i=1;i<=n;i++){
cin>>a[i];
}
sort(a+1,a+1+n,greater<int>());
for(int i=1;i<=n;i++){
d[i]=d[i-1]+a[i];
}
while(q--){
int x;cin>>x;
int ans=lower_bound(d+1,d+1+n,x)-d;
cout<<(ans==n+1?-1:ans)<<'\n';
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
F. 遍历维护
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1.5e5+10,M=1e6+10;
int vis[30],mp[N];
int n,k,d[N],a[N];
void solve(){
cin>>n>>k;map<int,int>mp;
for(int i=1;i<=n;i++){
cin>>a[i];mp[a[i]]++;
}
int ls=0,rs=-1,l=0,r=-1;
for(auto [i,j]:mp){
if(j<k)continue;
if(i-r>1)l=i;
r=i;
if(rs-ls<r-l){
rs=r;ls=l;
}
}
if(!~rs)cout<<-1<<'\n';
else cout<<ls<<" "<<rs<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
G. 树形dp (最喜欢的dp没有之一)
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=4e3+10,M=1e6+10;
int vis[30],dp[N][2];
int n,k,d[N],a[N];string s;
vector<int> g[N];
void dfs(int u,int fa){
if(s[u]=='W')dp[u][0]++;
else dp[u][1]++;
for(auto v:g[u]){
if(v==fa)continue;
dfs(v,u);
dp[u][0]+=dp[v][0],dp[u][1]+=dp[v][1];
}
}
void solve(){
cin>>n;
mem(dp,0);
s.clear();
for(int i=1;i<=n;i++) g[i].clear();
for(int i=2;i<=n;i++){
int x;cin>>x;
g[x].pb(i);g[i].pb(x);
}
cin>>s;s="?"+s;
dfs(1,-1);
int cnt=0;
for(int i=1;i<=n;i++)if(dp[i][0]==dp[i][1])cnt++;
cout<<cnt<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
H1 直接暴力
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define L(i,j,k) for(ll i=(j);i<=(k);++i)
#define R(i,j,k) for(ll i=(j);i>=(k);--i)
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=1e3+10,M=1e6+10;
int vis[30],dp[N][2];
int n,k,d[N],a[N];string s;
void solve(){
int n;cin>>n;int cnt=0;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<n;i++){
for(int j=i+1;j<=n;j++){
if(a[i]>=a[j])cnt++;
}
}
cout<<cnt<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}
H2 树状数组板子题
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
int lowbit(int x){return x&(-x);}
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
const int N=2e5+10,M=1e6+10;
int vis[30],dp[N][2];
int n,k,d[N],a[N],tr[N];string s;
void add(int x,int v){
for(;x<=n;x+=lowbit(x))tr[x]+=v;
}
int ask(int x){
int cnt=0;
for(int i=x;i>0;i-=lowbit(i))cnt+=tr[i];
return cnt;
}
void solve(){
cin>>n;mem(tr,0);mem(a,0);
for(int i=1;i<=n;i++)cin>>a[i];
int cnt=0;
for(int i=n;i>=1;i--){
cnt+=ask(a[i]);
add(a[i],1);
}
cout<<cnt<<'\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;cin>>t;
//int t=1;
while(t--){
solve();
}
}