90分,求助。
查看原帖
90分,求助。
1113528
yueluoxin1369楼主2024/3/19 23:00

第六组RE,本地试试对的。

#include<iostream>
#include<math.h>
using namespace std;
int end1[2600][3] = { 0 }, end2[2600][3] = { 0 };

int main() {
	int n1 =0, n2 =0;
	int race11[3] = { 0 }, race21[3] = { 0 };
	char n = getchar();
	while (n != 'E') {
		if (n == 'W') {
			race11[0]++;
			race21[0]++;
		}
		else if (n == 'L') {
			race11[1]++;
			race21[1]++;
		}
		if ((race11[0] >= 11 || race11[1] >= 11) && fabs(race11[0] - race11[1]) >= 2) {
			end1[n1][0] = race11[0], end1[n1++][1] = race11[1];
			race11[0] = 0, race11[1] = 0;
		}
		if ((race21[0] >= 21 || race21[1] >= 21) && fabs(race21[0] - race21[1]) >= 2) {
			end2[n2][0] = race21[0], end2[n2++][1] = race21[1];
			race21[0] = 0, race21[1] = 0;
		}

		n = getchar();
	}
	end1[n1][0] = race11[0], end1[n1++][1] = race11[1];
	end2[n2][0] = race21[0], end2[n2++][1] = race21[1];

	for (int i = 0; i < n1; i++)
		printf("%d:%d\n", end1[i][0], end1[i][1]);
	printf("\n");
	for (int i = 0; i < n2; i++)
		printf("%d:%d\n", end2[i][0], end2[i][1]);

	return 0;
}
2024/3/19 23:00
加载中...