1、可否简单图画的判定（1, can a simple picture of the decision）.docVIP

1、可否简单图画的判定（1, can a simple picture of the decision） I wipe it... Finally, AC, has been stuck in the last two test cases, but also can not think of what can be used to test examples, it is not reported, hoping to find an example from the book, the results... 443322 is the simple graph, and my output is no, then by hand, suddenly feel that it is not a cycle to re sort, it really is.... To be crazy, I think so many special use cases, the teachers use case is really weak burst!!! #include stdlib.h #include stdio.h Int comp (const, void, *a, const, void, *b) { Return * (int *) a * (int *) b; } Int, main () { Int, N, d[3000], I, J, end = 0, total = 0, max = 0; Scanf (%d, N); For (I = 0; I N; i++) { Scanf (%d, d[i]); Total = total + d[i]; If (d[i] max) Max = d[i]; } If (N = 1 and d[0] = = 0) Printf (yes\n); Else if (N = = 1 d[0]! = 0) Printf (no\n); Else if (total = 0 ||% 2! Max N - 1) / / without this step before judgment, all kinds of WA and RE Printf (no\n); Else { For (I = N - 1; I 0; i--) { Qsort (D, i+1, sizeof (d[0]), COMP); / / is here!!! Damn it! For (J = I - 1; J i-1-d[i]; j--) { If (J 0) { End = 1; Break; } D[j]--; If (d[j] 0) { End = 1; Break; } } If (end = 1) Break; } If (end = 1) Printf (no\n); Else if (end = = 0 d[0]! = 0) Printf (no\n); Else Printf (yes\n); } Return 0; } #include stdlib.h #include stdio.h Int comp (const, void, *a, const, void, *b) { Return * (int *) a * (int *) b; } Int, main () { Int, N, d[3000], I, J, end = 0, total = 0, max = 0; Scanf (%d, N); For (I = 0; I N; i++) { Scanf (%d, d[i]); Total = total + d[i]; If (d[i] max) Max = d[i]; } If (N = 1 and d[0] = = 0) / / before, here is a bug, but the teachers case is really suck, after two or anyway but actually have nothing to do with this. Printf (yes\n); Else if (N = = 1 d[0]! = 0) Printf (no\n); Else if (! (total% 2 = = 0 Max = N - 1)) / / without this step before judgment, all kinds of WA and RE Printf (no\n); Else { Qsort (D, N, sizeof (d[0]), comp); For (I = N - 1; I