9-29练习赛C组-1

A - Common Subsequence

水题 直接上代码

#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <sstream>
#include <deque>
#include <functional>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <stack>
#include <set>
#include <numeric>
#include <utility>
#include <cstring>
using namespace std;

int T;
int main(){
	cin >> T;
	int n, m;
	int a[1001], b[1001];
	while(T--){
		cin >> n >> m;
		for(int i = 0; i < n; i++){
			cin >> a[i];
		}
		for(int i = 0; i < m; i++){
			cin >> b[i];
		}
		
		int flag = 0;
		int num = 0;
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
				if(a[i] == b[j]){
					flag = 1;
					num = a[i];
					break;
				}
			}
		}
		
		if(flag == 1)
			cout << "YES" << '\n' << 1 << ' ' << num << endl;
		else
			cout << "NO" << endl;
	}
}

博弈 拿子 若碰到1改变胜负情况即可 当时cf的时候没写出来，补了
代码：
注意 :数组开小了，wa了三遍，罚时一个小时。。以后提交时要注意
代码：

#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>


#define LL long long
using namespace std;
#define MAXN 100011
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)


int T;
int N;
int a[MAXN];
void solve(){
    sd1(N);
    for(int i = 0; i < N;i++){
        sd1(a[i]);
    }
    int f = 1, l = 0;
    for(int i = 0; i < N; i++){
        if(a[i] == 1) {
            if(f) {
                f = 0;
                l = 1;
            }
            else if(l){
                f = 1;
                l = 0;
            }
        }
        else{
            if(f) {
                f = 1;
                l = 1;
            }
            else if(l){
                f = 0;
                l = 0;   
            }
            break;
        }
    }
    if(l == 1) cout << "First" << endl;
    else cout << "Second" << endl;
}
int main(){
    sd1(T);
    while(T--){
        solve();
    }
    //system("pause");
}

C D- Prefix Flip (Easy Version) CodeForces - 1382C1

题意 : 给两个01串进行如下操作， 使其相等
1，颠倒串，2，0改1， 1改0 问最少多少次这种操作可以完成
思路 : 将第一个串全部转成0或1，然后再从后往前遍历b和a，如果bi≠ai，就把ai前缀反转即可，这样最多n次，所以总共2n次 反转前缀和时前面的元素都相等，用c记录

#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<stdlib.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<map>
#include<stdio.h>
#include<string>


#define LL long long
using namespace std;
#define MAXN 100011
#define inf 100000001
#define sd1(i) scanf("%d", &i)
#define sd2(i, j) scanf("%d%d", &i, &j)
#define sl2(i, j) scanf("%lld%lld", &i, &j)
#define sd3(i, j, k) scanf("%d%d%d", &i, &j, &k)

int T;
int N;
char s1[MAXN], s2[MAXN];
int ans[MAXN*2];
void solve(){
    sd1(N);
    scanf("%s", s1);
    scanf("%s", s2);
    int cnt = 0;
    for(int i =0 ; i < N-1; i++){
        if(s1[i] == s1[i+1]) continue;
        if(s1[i] != s1[i+1]) {
            s1[i] = s1[i+1];
            ans[cnt++] = i+1;
        }
    }


    char c = s1[N-1];
    for(int i = N-1; i >= 0; i--){
        if(s2[i] == c) continue;
        if(s2[i] != c){
            if(c == '1') c = '0';
            else c = '1';
            ans[cnt++] = i+1;
        }
    }
    cout << cnt << ' ';
    for(int i = 0; i < cnt; i++){
        cout << ans[i] << ' ';
    }
    cout << endl;
}

int main(){
    sd1(T);
    while(T--){
        solve();
    }
    //system("pause");
    return 0;
}