Advertisement
Guest User

Untitled

a guest
Oct 15th, 2019
139
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.87 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int n,a[200001],aux,P=1,i;
  4. void citire()
  5. {
  6. cin>>n;
  7. for(int i=1;i<=n;i++)
  8. cin>>a[i];
  9. }
  10.  
  11. int sortare(int st, int dr)
  12. {
  13. int aux,i,j,di,dj;
  14. di=0;dj=1;i=st;j=dr;
  15. while(i<j)
  16. {
  17. if(a[i]>a[j])
  18. {
  19. aux=a[i];
  20. a[i]=a[j];
  21. a[j]=aux;
  22. aux=di;
  23. di=dj;
  24. dj=aux;
  25. }
  26. i=i+di;
  27. j=j-dj;
  28. }
  29. return i;
  30. }
  31.  
  32. void quick(int st, int dr)
  33. {
  34. int p;
  35. if(st<dr)
  36. {
  37. p=sortare(st,dr);
  38. quick(st,p-1);
  39. quick(p+1,dr);
  40. }
  41. }
  42.  
  43. void rezolva()
  44. {
  45. if(n==1)
  46. P=a[1];
  47. else
  48. if(a[1]*a[2]>a[n-1]*a[n])
  49. P=a[1]*a[2];
  50. else
  51. P=a[n-1]*a[n];
  52. cout<<P;
  53. }
  54.  
  55. int main()
  56. {
  57. citire();
  58. quick(1,n);
  59. rezolva();
  60. return 0;
  61. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement