随便刷刷的

杨辉三角形

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int MAXN = 10000000000;
long long n, m, k;
void solve(){
	cin >> n;
	vector<long long> v;
	if(n == 1){
		cout << "1\n";
		return ;
	}
	if(n == 2){
		cout << "5\n";
		return ;
	}
	long long cnt = 6, now = 3;
	v.push_back(1);
	v.push_back(2);
	while(1){
		if(now > 1000000){
			cout << (n) * (n + 1) / 2 + 2 << "\n";
			return ;
		}
		vector<long long> v1;
		v1.emplace_back(1);
		for(int i = 1; i < v.size(); i++){
			long long temp = v[i - 1] + v[i];
			if(temp > MAXN){
				break;
			}
			if(temp == n){
				cout << cnt + i + 1;;
				return ;
			}
			v1.emplace_back(temp);
		}
		if(now % 2 == 0){
			int temp = v.back() << 1;
			if(temp <= MAXN){
				v1.emplace_back(temp);
				if(temp == n){
				cout << cnt + v.size() + 1;
				return ;
				}  
			}
		}
        swap(v, v1);
        cnt += ++now;
    }
    
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

装饰珠

#include<bits/stdc++.h>
using namespace std;
const int N = 1e4 + 10;
int n, m, k;
#define int long long
int cnt[5];
int l[N];
vector<int> w[N];
int dp[N][305];
void solve(){
	for(int i = 0; i < 6; i++){
		//六件装备
		int n;
		cin >> n;
		for(int j = 0; j < n; j++){
			int x;
			cin >> x;
			cnt[x] ++;
			//把每个等级的装备分类
		}
	}
	cin >> m;
	for(int i = 0; i < m; i++){
		cin >> l[i] >> n;
		for(int j = 0; j < n; j++){
			int x;
			cin >> x;
			w[i].push_back(x);
		}
	}
	int sum = 0, sum1 = 0;
	for(int L = 4; L; L--){
		sum += cnt[L];
		//当前造成影响的数量
		for(int i = 0; i < m; i++){
			if(l[i] == L){
				sum1 ++;
				//当前珠子数量
				for(int j = 0; j <= sum; j++){
					dp[sum1][j] = dp[sum1 - 1][j];
					//不镶嵌的情况
				}
				for(int j = 0; j < w[i].size(); j++){
					for(int k = j + 1; k <= sum; k++){
						//把j+1个珠子换成l[i]的珠子
						dp[sum1][k] = max(dp[sum1][k], dp[sum1 - 1][k - j - 1] + w[i][j]);

					}	
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i <= sum; i++){
		ans = max(ans, dp[sum1][i]);
	}
	cout << ans << "\n";
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

The 16-th BIT Campus Programming Contest - Online Round(2022) C. Array Brush

#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int N = 1e5 + 10;
int n, m;
int a[N], b[N], c[N], ma[2][N], mi[2][N];
void solve1(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        b[i] = b[i - 1] + a[i];
    }
    ma[1][n + 1] = 0;
    mi[0][0] = 0x3f3f3f3f;
    mi[1][0] = 0x3f3f3f3f;
    mi[0][n + 1] = 0x3f3f3f3f;
    mi[1][n + 1] = 0x3f3f3f3f;
    for(int i = m; i <= n; i++){
        c[i] = b[i] - b[i - m];
        // cout << c[i] << "\n";
    }
    for(int i = 1; i <= n; i++){
        ma[0][i] = max(a[i], ma[0][i - 1]);
        mi[0][i] = min(a[i], mi[0][i - 1]);
    }
    for(int i = n; i; i--){
        ma[1][i] = max(a[i], ma[1][i + 1]);
        mi[1][i] = min(a[i], mi[1][i + 1]);
    }
    double ans = 100000000000;
    for(int i = m; i <= n; i++){
        double mii = c[i] * 1.0 / m;
        double maa = c[i] * 1.0 / m;
        mii = min({mii, mi[0][i - m] * 1.0, mi[1][i + 1] * 1.0});
        maa = max({maa, ma[0][i - m] * 1.0, ma[1][i + 1] * 1.0});
        ans = min(ans, maa - mii);
    }
    cout << fixed << setprecision(6) << ans << "\n";
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve1();
    }
    return 0;
}