Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<string.h>
- #include<stdio.h>
- using namespace std ;
- int arraypos[2000];
- int arrayneg[2000];
- #define pos 1000;
- int a[1000000];
- int main()
- {
- int cases ;
- scanf("%d",&cases);
- while(cases--)
- {
- int n ;
- scanf("%d",&n);
- int sav=n;
- int pindex =0;
- int flag=0;
- while(n)
- {
- scanf("%d",&a[pindex++]);
- if(flag==1)
- {
- n--;
- continue ;
- }
- int prob=a[pindex-1];
- if(a[pindex-1]>=0)
- {
- arraypos[prob]++;
- if(arraypos[prob]>(sav/2))
- {
- printf("YES %d\n",a[pindex-1]);
- flag=1;
- }
- }
- else
- {
- arrayneg[prob]++;
- if(arrayneg[prob]>(sav/2))
- {
- printf("YES %d\n" , a[pindex-1]);
- flag=1;
- }
- }
- n--;
- }
- if(flag==0)
- puts("NO");
- memset(arraypos , 0 , sizeof arraypos);
- memset(arrayneg , 0 , sizeof arrayneg);
- flag=0;
- pindex=0;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement