#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#define endl '\n'
//#define int long long
using namespace std;
string s;
void solve() {
cin>>s;
if(s=="abc"||s=="cba"||s=="bac"||s=="acb") cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#define endl '\n'
#define int long long
using namespace std;
const int N=20;
int a[N];
int n;
void solve() {
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
int maxn=0;
for(int i=1;i<=n;i++){
int x=a[i]+1;
for(int j=1;j<=n;j++){
if(i==j) continue;
x*=a[j];
}
maxn=max(maxn,x);
}
cout<<maxn<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#define endl '\n'
//#define int long long
using namespace std;
const int N=20;
char s[N][N];
void solve() {
for(int i=1;i<=10;i++){
for(int j=1;j<=10;j++){
cin>>s[i][j];
}
}
int res=0;
for(int i=1;i<=10;i++){
for(int j=1;j<=10;j++){
if(s[i][j]=='.') continue;
if(i==1||i==10||j==1||j==10) res+=1;
else if(i==2||i==9||j==2||j==9) res+=2;
else if(i==3||i==8||j==3||j==8) res+=3;
else if(i==4||i==7||j==4||j==7) res+=4;
else if(i==5||i==6||j==5||j==6) res+=5;
}
}
cout<<res<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#define endl '\n'
//#define int long long
using namespace std;
int k,n;
string s;
void solve() {
cin>>n>>k;
cin>>s;
int ans=0;
for(int i=0;i<s.size();i++){
if(s[i]=='B'){
ans++;
i+=k-1;
}
}
cout<<ans<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#define endl '\n'
#define int long long
using namespace std;
const int N=2e5+10;
int a[N];
int n,x;
bool check(int h){
int sum=0;
for(int i=1;i<=n;i++){
if(h>a[i]) sum+=h-a[i];
if(sum>x) return false;
}
return true;
}
void solve() {
cin>>n>>x;
for(int i=1;i<=n;i++) cin>>a[i];
int l=1,r=1e18;
while(l<r){
int mid=(l+r+1)/2;
if(check(mid)) l=mid;
else r=mid-1;
}
cout<<l<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#define endl '\n'
#define int long long
using namespace std;
const int N=2e5+10;
int a[N],h[N];
int n,k;
void solve() {
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>h[i];
vector<vector<int>>e(n+1);
int cnt=0;
e[0].push_back(1);
for(int i=2;i<=n;i++){
if(h[i-1]%h[i]==0) e[cnt].push_back(i);
else {
cnt++;
e[cnt].push_back(i);
}
}
int ans=0;
for(int i=0;i<=cnt;i++){
int len=0;
int sum=0;
int l=e[i][0];
for(int j=0;j<e[i].size();j++){
sum+=a[e[i][j]];
if(sum<=k){
len=max(len,e[i][j]-l+1);
}
else{
sum-=a[l];
l++;
}
}
ans=max(ans,len);
}
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
一开始猜测用栈,想着通过一个一个,把能消的全部消掉,毕竟是猜测的,最终算法错误
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<stack>
#define endl '\n'
#define int long long
using namespace std;
string ss;
void solve() {
cin>>ss;
stack<char>s;
s.push(ss[0]);
int ans=0;
for(int i=1;i<ss.size();i++){
char t=s.top();
if(ss[i]=='B'&&t=='A'){
ans++;
if(s.size()) s.pop();
s.push('B');
s.push('C');
}
else if(ss[i]=='A'&&t=='B'){
ans++;
if(s.size()) s.pop();
s.push('C');
s.push('B');
}
else s.push(ss[i]);
}
while(s.size()>1){
char x=s.top();
s.pop();
char t=s.top();
if(x=='B'&&t=='A'){
ans++;
if(s.size()) s.pop();
s.push('B');
s.push('C');
}
else if(x=='A'&&t=='B'){
ans++;
if(s.size()) s.pop();
s.push('C');
s.push('B');
}
}
cout<<ans<<endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
通过观察,发现AAAAAAB可以将所有的A都消掉,BAAAAA也可以将所有的A都消掉,但是AAAAABAAAA只可以消掉一边的A
AAAABAAAAABAA,当出现这种情况时,我们只有一段连续的A消不掉,要使得获得的硬币最多,那么我们选择让连续的A的个数最小的那一段消不掉,所以答案即为sum-minn,其中sum为A的总个数,minn为最小的连续的A的个数
AC代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#define endl '\n'
//#define int long long
using namespace std;
string s;
void solve() {
cin>>s;
int sum=0;//A的总个数
int cnt=0;//连续的A的个数
int minn=2e9;//最小的连续的A的个数
for(int i=0;i<s.size();i++){
if(s[i]=='A'){
sum++;
cnt++;
}
else{
minn=min(minn,cnt);
cnt=0;
}
}
minn=min(minn,cnt);
cout<<sum-minn<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}
基环树--整个图联通,N个点N条边,比一棵树多一条边,导致出现了唯一的环
首先这个图内有且仅有一个环,然后V要想躲避M只需要跑到环的地方即可,如果V能够先跑到环中的一点就能成功躲避,如果同时跑到则不能同时躲避
做法:先从起点a出发,跑一遍bfs,求出各个点离a的最短距离,然后从b出发跑一遍dfs
AC代码:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#define endl '\n'
//#define int long long
using namespace std;
const int N=2e5+10;
int dist[N];
int vis[N];
int n,a,b;
bool ok;
vector<vector<int>>e(N);
void dfs(int x,int y){
for(auto v:e[x]){
if(vis[v]&&v!=y&&vis[v]<dist[v]) ok=true;
if(vis[v]) continue;
vis[v]=vis[x]+1;
dfs(v,x);
}
}
void solve() {
cin>>n>>a>>b;
memset(dist,0,sizeof dist);
memset(vis,0,sizeof vis);
for(int i=1;i<=n;i++) e[i].clear();
for(int i=0;i<n;i++){
int u,v;
cin>>u>>v;
e[u].push_back(v);
e[v].push_back(u);
}
queue<int>q;
dist[a]=1;
q.push(a);
while(q.size()){
int t=q.front();
q.pop();
for(auto v:e[t]){
if(dist[v]) continue;
q.push(v);
dist[v]=dist[t]+1;
}
}
ok=false;
vis[b]=1;
dfs(b,0);
if(ok) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
cin>>t;
while(t--) {
solve();
}
return 0;
}