暑假补题【7-1】（codeforces）Educational Codeforces Round 121 (Rated for Div. 2)

黑山咩

已于 2022-07-01 15:24:00 修改

阅读量158

点赞数

分类专栏：题解文章标签：算法

于 2022-07-01 14:54:32 首次发布

本文链接：https://blog.csdn.net/m0_51678367/article/details/125557969

版权

题解专栏收录该内容

52 篇文章 1 订阅

订阅专栏

在这里插入图片描述

在这里插入图片描述
代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define x first
#define y second
#define lowbit(x) (x&(-x))
const int N = 200;
ll a[N], h[N];

void solve(){
	int n;
	cin >> n;
	for(int i = 1; i <= n; i ++){
		cin >> a[i];
	}
	for(int i = 1; i <= n; i ++){
		cin >> h[i];
	}
	ll ans = 0, last = n;
	for(int i = n; i >= 1; i --){
		if((a[i] - a[i - 1]) >= h[i]){
			int dis = a[i] - h[i];
			ans += (a[last] - dis + 1) * (a[last] - dis) / 2;
			last = i - 1;
		}
		else{
			h[i - 1] = max(h[i - 1], h[i] - (a[i] - a[i - 1]));
		}
	}
	cout << ans << endl;
}

int main(){
	int T;
	cin >> T;
	while(T--)
		solve();
}

D
在这里插入图片描述

在这里插入图片描述

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define x first
#define y second
#define lowbit(x) (x&(-x))
const int N = 2e5 + 10;
int a[N], cnt[N], n;

ll cal(int x, int y){	
	ll sum1 = 0, sum2 = 0, sum3 = 0, k = 1;
	for(; k <= n; k ++){
		if(sum1 + cnt[k] > x)break;
		sum1 += cnt[k];
	}
	for(; k <= n; k ++){
		if(sum2 + cnt[k] > y)break;
		sum2 += cnt[k];
	}
	sum3 = n - sum1 - sum2;
	ll z = 1;
	while(sum3 > z) z <<= 1;
	return x - sum1 + y - sum2 + z - sum3;
}

void solve(){ 
	cin >> n;
	for(int i = 0; i <= n; i ++) cnt[i] = 0;
	for(int i = 1; i <= n; i ++){
		cin >> a[i];
		cnt[a[i]] ++;
	}
	ll ans = 1e18;
	for(int i = 0; i <= 20; i ++){
		for(int j = 0; j <= 20; j ++){
			ans = min(ans, cal(1 << i, 1 << j));
		}
	}
	cout << ans << endl;
}

int main(){
	int T;
	cin >> T;
	while(T--)
		solve();
}