2024牛客寒假算法基础集训营1 题解 ( A,M,L,G,C,E )

2024牛客寒假算法基础集训营1 题解

A DFS搜索

题意

���所给字符串中是否有依次出现的 ‘D’ ‘F’ ‘S’ 和 ‘d’ ‘f’ ‘s’

思路

所以可以依次判断两种情况

1. 找到D再找F再找S
2. 找到d再找f再找s

依次根据是否满足条件输出1或0

代码

/*******************************| Author:  AlwaysBeShine| Problem: DFS搜索| Contest: NowCoder| URL:     https://ac.nowcoder.com/acm/contest/67741/A| When:    2024-02-02 13:00:53| | Memory:  524288 MB| Time:    2000 ms*******************************/#include using namespace std;typedef long long ll;void solve(){    int n;    cin >> n;    string s;    cin >> s;   int cnt1 = 0,cnt2 = 0;   for(int i = 0;i > h >> w;    if(h > b;    if(pos[a] == 0){    q.push_back({a,b});    pos[a] = q.size() - 1;    }else{    q[pos[a]].second += b;    }    }    sort(q.begin(),q.end());    for(int i = 0;i = 0;i--){    if(q[i].first - q[i].second