Submission #67031315

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N;
char S[114514];
int main(void) {
  int T, tc;
  if (scanf("%d", &T) != 1) return 1;
  for (tc = 0; tc < T; tc++) {
    int i;
    int nuki = -1;
    if (scanf("%d", &N) != 1) return 1;
    if (scanf("%114513s", S) != 1) return 1;
    for (i = 1; i < N; i++) {
      if (S[i - 1] > S[i]) {
        nuki = i - 1;
        break;
      }
    }
    if (nuki < 0) {
      /* 長さ1の連続部分文字列を選ぶ → 変わらない */
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
char S[114514];

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		int i;
		int nuki = -1;
		if (scanf("%d", &N) != 1) return 1;
		if (scanf("%114513s", S) != 1) return 1;
		for (i = 1; i < N; i++) {
			if (S[i - 1] > S[i]) {
				nuki = i - 1;
				break;
			}
		}
		if (nuki < 0) {
			/* 長さ1の連続部分文字列を選ぶ → 変わらない */
			puts(S);
		} else {
			int ire = -1;
			for (i = nuki + 1; i < N; i++) {
				if (S[nuki] < S[i]) {
					ire = i;
					break;
				}
			}
			for (i = 0; i < N; i++) {
				if (i == ire) putchar(S[nuki]);
				if (i != nuki) putchar(S[i]);
			}
			if (ire < 0) putchar(S[nuki]);
			putchar('\n');
		}
	}
	return 0;
}

/*

ポイント：辞書順は、後ろがどうなろうと、前で勝ってしまえば勝ち

最初に1文字抜いたほうが有利になるところで抜く
→ その後、最初に抜いた文字を入れたほうが有利になるところで入れる

*/

Submission Info

Judge Result