CF-931（已更新：AB代码）

合集 - 蒟蒻的打怪升级之路(28)

1.CF-925（已更新：D-F）2024-02-142.2024牛客寒假算法基础集训营32024-02-133.CF-926(已更新：B-C)2024-02-164.CF-927(已更新：B C E)2024-02-195.CF-928(已更新：B C D E)2024-02-206.2024牛客寒假算法集训营4 (已更新：B-E)2024-02-207.CF EDU-162 (已更新：A-C+D的代码)2024-02-248.At-abc3422024-02-259.蒟蒻的补档题(长期更新)2024-03-0810.CF-929(已更新：B-E)2024-02-28

11.CF-931（已更新：AB代码）2024-03-02

12.PowerOj 2024-康复赛 (待更新)2024-03-0613.CF-932(已更新 A B)2024-03-0614.矩阵快速幂2024-03-1315.CF-933(已更新：B-D)2024-03-1216.数论分块2024-03-1517.CF-Edu-163（已更新：A B）2024-03-1618.CF-936(AB)2024-03-2319.AT-abc347（C-E）2024-04-0520.CF-938(C-E)2024-04-1821.CF-943(已更B-E,G1)2024-05-0322.CF-945(已更A,B)2024-05-1823.CF-956(A-D)2024-07-0824.CF-957(D-E)2024-07-1425.CF-959（C-E）2024-07-2026.Codeforces Round 967 (Div. 2)-D2024-08-2227.AtCoder Beginner Contest 396 (E-F)03-1128.Codeforces Round 1008 (Div. 2) (C-D)03-11

收起

CF-931(A+B)

上场的C都没补，等补了在更新(⊙﹏⊙)

要去医院看牙的前一天我居然还会熬这个(⊙﹏⊙)

先贴代码……

A

代码

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define db(x) cout<<x<<" "<<endl;
#define _db(a,n) for(int i=1;i<=n;i++) cout<<a[i]<<" ";cout<<endl;
#define mem(a) memset(a,0, sizeof(a))
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define per(i,r,l) for(int i=r;i>=l;i--)
const int N=2e5+5;
int a[N];
void solve(){
	int n,x,ans=0,sum=0;cin>>n;
	rep(i,1,n){
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	ans=abs(a[n]-a[1])+abs(a[1]-a[n-1])+abs(a[n-1]-a[2])+abs(a[2]-a[n]);
	cout<<ans<<endl;
}
signed main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
	int t;cin>>t;while(t--)
	solve();
	return 0;
}

?

B

实际卡住的是小于30的部分(⊙﹏⊙)

分析

代码

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define db(x) cout<<x<<" "<<endl;
#define _db(a,n) for(int i=1;i<=n;i++) cout<<a[i]<<" ";cout<<endl;
#define mem(a) memset(a,1e9, sizeof(a))
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define per(i,r,l) for(int i=r;i>=l;i--)
const int N=55;
//int dp[N];
int a[5]={15,10,6,3,1};

void solve(){
	int n;cin>>n;
	int cnt=0;
	if(n>=30){
		cnt+=(n-30)/15;
		n-=cnt*15;
	}
	//n=30+n%30;
//	cout<<n<<endl;
	//mem(dp);
	vector<int>dp(n+1,1e9);
    dp[0]=0;
    rep(i,1,n){
        rep(j,0,4){
            if(i>=a[j]&&dp[i-a[j]]+1<dp[i]){
                dp[i]=dp[i-a[j]]+1;
            }
        }
    }
    cnt+=dp[n];
	cout<<cnt<<endl;
}
signed main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
	int t;cin>>t;while(t--)
	solve();
	return 0;
}