Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n;
- cin>>n;
- int ara[n+1],inc[n+1],dec[n+1],in=0,de=0;
- map<int,int>mp;
- bool ok=false;
- for(int i=0;i<n;i++)
- {
- cin>>ara[i];
- mp[ara[i]]++;
- }
- sort(ara,ara+n);
- for(int i=0;i<n;i++)
- {
- if(mp[ara[i]]==1)dec[de++]=ara[i];
- else if(mp[ara[i]]==2)
- {
- dec[de++]=ara[i];
- inc[in++]=ara[i];
- i++;
- }
- else
- {
- ok=true;
- break;
- }
- }
- if(ok)
- {
- printf("NO\n");
- }
- else
- {
- printf("YES\n");
- if(in==0)
- {
- printf("0\n");
- }
- else
- {
- sort(inc,inc+in);
- printf("%d\n",in);
- for(int i=0;i<in;i++)
- printf("%d ",inc[i]);
- printf("\n");
- }
- sort(dec,dec+de);
- printf("%d\n",de);
- for(int i=de-1;i>=0;i--)
- {
- printf("%d ",dec[i]);
- }
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement