求助,subtask#2 #8 WA
查看原帖
求助,subtask#2 #8 WA
759274
Stevehim楼主2022/9/10 18:17
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
int n;
long long int a[500005];
long long int b[500005];
//骗不了样例

int sum = 0;

int main() {
	cin >> n;
	for (long long int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (long long int j = 0; j < n; j++) {
		cin >> b[j];
	}
	int num = 0;
	int num_1 = 0;
	for (long long int i = 0, j = n - 1; i < n, j >= 0; i++, j--) {
		if (a[i] == b[j]) {
			num++;
		}
		if (a[i] == b[i]) {
			num_1++;
		}
	}
	if (n / 2 <= num && num > num_1) { //有意义的反转
		sum++;
		sum += n - num;
	} else { //其实这个时候反转没有意义
		sum = n - num_1;
	}
	cout << sum;
	return 0;
}

2022/9/10 18:17
加载中...