T1:删删
评析:怎么判断回文串呢,左右两个指针一起往中间移动,到那个两边不一样了就不是,这里我们就采取这种方式来删字符,我们直接枚举‘a'到'z'就可以,再分成三种情况:两边都删,左边删,右边删。
#include<bits/stdc++.h>
using namespace std;
string s;
int t,n,f;
int main()
{
cin>>t;
int ans,res=1e9;
for (int i=1;i<=t;i++)
{
cin>>n;
cin>>s;
for (char i='a';i<='z';i++)
{
int l=0,r=n-1;
ans=0;
while(l<r)
{
if (s[l]==s[r])
{
l++;
r--;
}
else
{
if (s[l]==i)
{
l++;
ans++;
}
else if (s[r]==i)
{
r--;
ans++;
}
else
{
f=1;
break;
}
}
}
if (f==1)
{
f=0;
continue;
}
else res=min(res,ans);
}
if (res==1e9) cout<<"-1"<<endl;
else
{
cout<<res<<endl;
//ans=0;
res=1e9;
}
}
}
T2:快快变大
评析:区间dp,借鉴了大佬,设dp[i][j]为区间i,j上最大值,先用前缀积预处理,接着三重循环遍历每个区间内的每个子串,用转移方程 dp[l][r] = max(dp[l][r], dp[l][k] + dp[k + 1][r] + (num[l][k] - num[k + 1][r]) * (num[l][k] - num[k + 1][r]));
#include<bits/stdc++.h>
using namespace std;
long long num[305][305];
long long dp[305][305];
#define mode 1000003
#define endl '\n'
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)cin >> num[i][i];
//计算前缀积的方式
for (int i = 1; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)
{
num[i][j] = num[j][j];
num[i][j] = (num[i][j] * num[i][j - 1]) % mode;
}
}
for (int len = 2; len <= n; len++)
{
for (int l = 1, r = l + len - 1; r <= n; l++,r++)//二重循环是在根据区间长度遍历所有的区间
{
for (int k = l; k < r; k++)//三重循环则是在遍历每一个区间里的子区间
{
dp[l][r] = max(dp[l][r], dp[l][k] + dp[k + 1][r] + (num[l][k] - num[k + 1][r]) * (num[l][k] - num[k + 1][r]));
}
}
}
cout << dp[1][n] << endl;
return 0;
}
T3:饿饿 饭饭2
评析:看到有些人做的挺复杂,其实不就是把一个数里面的因数2和3全拿掉比较一下剩下的一不一样就i好了
#include<bits/stdc++.h>
using namespace std;
int t,n,a[200005],x[200005],f;
int main()
{
cin>>t;
while(t--)
{
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++)
{
while(a[i])
{
if (a[i] % 3==0) a[i]=a[i]/3;
else if (a[i] % 2==0) a[i]=a[i]/2;
else
{
x[i]=a[i];
break;
}
}
}
for (int i=1;i<=n-1;i++)
{
if (x[i]==x[i+1]) f=0;
else
{
f=1;
break;
}
}
if (f==1)
{
cout<<"NO"<<endl;
f=0;
}
else cout<<"YES"<<endl;
}
}
T4:字串分值和
评析:在后面接一个一样的就不用什么循环了嘛
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+5;
int pre[N];
int a[30];
string s;
signed main()
{
cin>>s;
s=' '+s;
int n=s.length()-1;
int res=0;
for(int i=1;i<=n;i++)
{
pre[i]=a[s[i]-'a'];
res+=(i-pre[i])*(n-i+1);
a[s[i]-'a']=i;
}
cout<<res;
return 0;
}
T5:蒟蒻
评析:看大佬知道了用map,这容器是真强啊,直接判断一下是操作几,扫一遍找不找得到就好
#include<iostream>
using namespace std;
#include<map>
typedef long long ll;
typedef pair<int, int>PII;
int main() {
int n,ans=0;
cin >> n;
map<int, int>p, t;
while (n--)
{
int st;
cin >> st;
if (st == 1)
{
int a, b;
cin >> a >> b;
if (p.count(a) == 0 && t.count(b) == 0)
{
p[a] = b;
t[b] = a;
}
}
else if (st == 2)
{
t.erase(p.begin()->second);
p.erase(p.begin());
}
else if (st == 3)
{
p.erase(t.begin()->second);
t.erase(t.begin());
}
}
ll sum = 0;
for (auto i : p)sum += i.first;
cout << sum << endl;
return 0;
}
T6:锦标赛
评析:想通了就会很简单,排序,计数间距过小的相邻项就好
#include<bits/stdc++.h>
using namespace std;
int n,k,a[100005],ans=1;
int main()
{
cin>>n>>k;
for (int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1);
for (int i=n;i>1;i--)
{
if (a[i]-a[i-1]<=k) ans++;
else break;
}
cout<<ans;
}
T7:可重排列
评析:字典序那就dfs,有点类似全排列那题
#include<bits/stdc++.h>
using namespace std;
int n,p[15],ans[100005],sum;
void dfs(int x)
{
if (x==sum+1)
{
for (int i=1;i<=sum;i++)
{
cout<<ans[i]<<" ";
}
cout<<'\n';
return;
}
for (int i=1;i<=9;i++)
{
if (p[i]!=0)
{
p[i]--;
ans[x]=i;
dfs(x+1);
p[i]++;
}
}
}
int main()
{
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>p[i];
sum+=p[i];
}
dfs(1);
}
T8:进制转换
评析:模拟,记得用pow,相当于求x的y次方,我是先转换为十进制,然后类比我们以前十进制转二进制那种不断除以进制n的方法,最后从尾到头读取就是转化后的数
#include<bits/stdc++.h>
using namespace std;
int n,m,t;
long long sum;
string s,s2;
int main()
{
cin>>n>>m;
vector<long long>ans(n+5);
for (int i=1;i<=n;i++)
{
cin>>t>>s;
int len=s.length();
for (int j=0;j<len;j++)
{
if (s[j]>='0' && s[j]<='9') ans[i]+=(s[j]-'0')*pow(t,len-j-1);
else if (s[j]>='a' && s[j]<='z') ans[i]+=(s[j]-'a'+36)*pow(t,len-j-1);
else if (s[j]>='A' && s[j]<='Z') ans[i]+=(s[j]-'A'+10)*pow(t,len-j-1);
}
sum+=ans[i];
}
vector<int>v;
while(sum>=m)
{
v.push_back(sum % m);
sum/=m;
}
if (sum>0) v.push_back(sum);
for (int i=v.size()-1;i>=0;i--)
{
if (v[i]>=0 && v[i]<=9) s2+=('0'+v[i]);
else if (v[i]>=10 && v[i]<=35) s2+=('A'+v[i]-10);
else if (v[i]>=36 && v[i]<=61) s2+=('a'+v[i]-36);
}
cout<<s2;
}
T9:循环子串
评析:字符串操作题,学到了。substr取子串,reverse(s.begin(),s.end())反转,s.find(s2)==1,找是否存在此子串
#include<bits/stdc++.h>
using namespace std;
int t, n;
string s;
bool flag;
int main()
{
cin>>t;
while(t--)
{
cin>>n>>s;
s+=s;
flag=1;
for (int i=2; i<=n; i++)
{
for (int j=0; i+j<=n; j++)
{
string s2=s.substr(j,i);
reverse(s2.begin(), s2.end());
if (s.find(s2)==-1)
{
cout<<"NO"<<endl;
flag=0;
break;
}
}
if (flag==0)break;
}
if (flag==1)cout<<"YES"<<endl;
}
return 0;
}
T10:饿饿 饭饭之暑假大狂欢
评析:其实就是判断是不是包含关系,我本来用字符串和上体一样的判断字串做,一直过不了,直接改用标记法才过,不知为啥
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll>PII;
int mymap[101][101];
int main()
{
int t, n;
cin >> t;
for (int i = 0; i < t; i++)
{
cin >> n;
for (int j = 0; j < n; j++)
{
int num;
cin >> num;
mymap[i][num]=1;
}
}
for (int i = 0; i < t; i++)
{
bool flag = true;
for (int j = 0; j < t; j++)
{
if (i == j)continue;
bool st = false;
for (int k = 0; k <= 100; k++)
{
if (mymap[i][k] < mymap[j][k])
{
st = true;
break;
}
}
if (!st)
{
flag = false;
break;
}
}
if (!flag)
{
cout << "NO" << endl;
}
else cout << "YES" << endl;
}
return 0;
}