vp过去好久了,一直拖着没补,今天写一下题解
A
ACcode
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
void solve() {
int n, x; cin >> n >> x;
vector<int>a(n + 3);
for (int i = 1; i <= n; i++)cin >> a[i];
int ma = -1;
a[0] = 0;
for(int i = 1; i <= n; i++)ma = max(a[i] - a[i-1],ma);
ma = max(ma, 2 * (x - a[n]));
cout << ma << '\n';
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--) {
solve();
}
return 0;
}
B
思路
每次可执行两个操作之一,移动到相邻,要么传送到某个格子(可以是自己),假设子序列a,b,c,且a小于b,b大于c,那么对于b来说,需要在a的基础上多加(b-a)次重复移动到b所在的格子上,而c比b小,则在前几次中随便几次让格子从b移动到c就行了,会被包括在b的次数里。
综上,我们只需要叠加每一个递增的b-a就好了
注意,最后结果要-1,我们从1开始的,不-1会有错误,具体看代码
ACcode
#include<iostream>
#include<vector>
using namespace std;
using ll = long long;
void solve() {
int n; cin >> n;
vector<int>a(n + 3);
for (int i = 0; i < n + 3; i++)a[i] = 0;
for (int i = 1; i <= n; i++)cin >> a[i];
ll ans = 0;
a[0] = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > a[i - 1])ans += a[i] - a[i - 1];
}
cout << ans - 1 << '\n';
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--) {
solve();
}
return 0;
}
C
思路
每次取最小值即可,当最大值等于最小值时结束
ACcode
#include<iostream>
#include<vector>
#include<climits>
using namespace std;
void solve() {
int n; cin >> n;
vector<int>a(n + 3);
//每次加最小值
int mi = INT_MAX;
int ma = INT_MIN;
for (int i = 1; i <= n; i++) {
cin >> a[i];
mi = min(mi, a[i]);
ma = max(ma, a[i]);
}
int ans = 0;
int x = mi;
while (mi < ma) {
ans++;
mi = mi + x >> 1;
ma = ma + x >> 1;
}
cout << ans << '\n';
if (ans != 0 && ans <= n) {
for (int i = 1; i <= ans; i++)cout << mi << ' ';
}
cout << '\n';
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--) {
solve();
}
return 0;
}