A New Palindrome
解题思路
很明显如果回文串由大于2种字符构成,一定能重组成不同的回文串;
当只有1种组成,很明显不能;
有两种时,当其中一种只有一个的时候(比如aabaa),不能,反之则可以
参考代码
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define cy cout << "YES" << endl
#define cn cout << "NO" << endl
#define forn(i, l, r) for (int i = l; i <= r; i++)
#define fornk(i, l, r, k) for (int i = l; i <= r; i += k)
#define forn_(i, l, r) for (int i = l; i >= r; i--)
#define fornk_(i, l, r, k) for (int i = l; i >= r; i -= k)
const int N = 1e3 + 5;
ll T;
string s;
unordered_map<char, int>mp;
void solve() {
cin >> s;
mp.clear();
forn(i, 0, s.size() - 1) mp[s[i]]++;
if (mp.size() > 2) cy;
else {
if (mp.size() == 1) cn;
else {
int ok = 1;
for (auto i : mp) {
if (i.second == 1) ok = 0;
}
if (ok) cy;
else cn;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
T = 1;
cin >> T;
while (T--) solve();
return 0;
}
B Maximum Sum
解题思路
2*k< n,所以两种操作肯定不互相影响;
将数组排序后,发现两种操作分别是删去左右两端的数(操作顺序不影响),于是我们可以枚举其中一种操作的次数,并使用前缀和优化,不断更新答案即可
参考代码
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define cy cout << "YES" << endl
#define cn cout << "NO" << endl
#define forn(i, l, r) for (int i = l; i <= r; i++)
#define fornk(i, l, r, k) for (int i = l; i <= r; i += k)
#define forn_(i, l, r) for (int i = l; i >= r; i--)
#define fornk_(i, l, r, k) for (int i = l; i >= r; i -= k)
const int N = 2e5 + 5;
ll T;
ll n, k;
ll a[N], s[N];
void solve() {
ll ans = 0;
cin >> n >> k;
forn(i, 1, n) cin >> a[i];
sort(a + 1, a + n + 1);
forn(i, 1, n) s[i] = s[i - 1] + a[i];
forn(i, 0, k) {
// ll res = s[n] - (s[n] - s[n - i]) - s[2 * (k - i)];
ll res = s[n - i] - s[2 * (k - i)];
ans = max(ans, res);
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
T = 1;
cin >> T;
while (T--) solve();
return 0;
}
C Contrast Value
解题思路
找规律,对于递增或者递减的一段序列,其对比度(the contrast of the array)即为最两端的元素的对比度,
我们只要求给定数组种这样的序列有多少个即可,另外对于对比度为0的序列需要特判
参考代码
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define cy cout << "YES" << endl
#define cn cout << "NO" << endl
#define forn(i, l, r) for (int i = l; i <= r; i++)
#define fornk(i, l, r, k) for (int i = l; i <= r; i += k)
#define forn_(i, l, r) for (int i = l; i >= r; i--)
#define fornk_(i, l, r, k) for (int i = l; i >= r; i -= k)
const int N = 3e5 + 5;
ll T;
ll n, k;
ll a[N];
void solve() {
ll ans = 0;
cin >> n;
forn(i, 1, n) cin >> a[i];
vector<ll>v;
v.push_back(a[1]);
forn(i, 2, n) {
if (a[i] != v.back()) v.push_back(a[i]);
}
if (v.size() == 1) ans = 1;
else {
ans = 1;
for (int l = 0; l < v.size(); l++) {
ll r = l + 1;
if (l == v.size() - 1) {
break;
}
if (v[r] > v[l]) {
while (r < v.size() && v[r] > v[r - 1]) r++;
l = r - 1;
ans++;
} else {
while (r < v.size() && v[r] < v[r - 1]) r++;
l = r - 1;
ans++;
}
l--;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
T = 1;
cin >> T;
while (T--) solve();
return 0;
}