fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. const int N = 2e5+10;
  4.  
  5. int n,cnt;
  6. int a[N],b[N],temp;
  7.  
  8. int main() {
  9. scanf("%d",&n);
  10. for (int i = 1; i <= n; i++) scanf("%d",&a[i]);
  11. sort(a+1, a+n+1);
  12. cnt = 1;
  13. vector<int>c;
  14. a[0] = -233;
  15. for (int i = 1; i <= n; i++) {
  16. if (a[i] != a[i-1]) {
  17. b[cnt++] = a[i];
  18. }
  19. else {
  20. if (a[i] == temp) {
  21. break;
  22. }
  23. else {
  24. c.insert(c.begin(), a[i]);
  25. temp = c[0];
  26. }
  27. }
  28. }
  29. cnt--;
  30. if (cnt + (int)c.size() == n) {
  31. printf("YES\n");
  32. printf("%d\n",cnt);
  33. for (int i = 1; i <= cnt; i++) printf("%d ",b[i]);
  34. printf("\n");
  35. printf("%d\n",(int)c.size());
  36. for (int i = 0; i < (int)c.size();i++) printf("%d ",c[i]);
  37. return 0;
  38. } else {
  39. printf("NO\n");
  40. }
  41. return 0;
  42. }
Success #stdin #stdout 0s 16800KB
stdin
Standard input is empty
stdout
YES
0

0