题目链接
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3959
AC代码
#include <cstdio> #include <cstring> #include <ctype.h> #include <cstdlib> #include <iostream> #include <algorithm> #include <cmath> #include <deque> #include <vector> #include <queue> #include <string> #include <map> #include <stack> #include <set> #include <numeric> #include <sstream> using namespace std; typedef long long LL; const double PI = 3.14159265358979323846264338327; const double E = 2.718281828459; const double eps = 1e-6; const int MAXN = 0x3f3f3f3f; const int MINN = 0xc0c0c0c0; const int maxn = 1e2 + 5; const int MOD = 1e9 + 7; int arr[maxn]; int main() { int t; scanf("%d", &t); a: while (t--) { int n; memset(arr, 0, sizeof(arr)); scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &arr[i]); sort(arr, arr + n); if (n < 10 || n > 13) { cout << "No\n"; goto a; } else { int MAX = arr[n - 1]; if (MAX == 1) { cout << "No\n"; goto a; } if (arr[0] != 1 || arr[1] != 1) { cout << "No\n"; goto a; } else { for (int i = 2; i < n; i++) { if (arr[i] == MAX) continue; else if (arr[i] - arr[i - 1] > 2) { cout << "No\n"; goto a; } } } } cout << "Yes\n"; } }转载于:https://www.cnblogs.com/Dup4/p/9433272.html
相关资源：JAVA上百实例源码以及开源项目