Advertisement
georgiu_marius

inserare

Feb 27th, 2020
133
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.07 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3. int v[10009];
  4. int main ()
  5. {
  6. int n,i,p,x,min=INT_MAX,max=INT_MIN,pmax=0,pmin=1;
  7. cin>>n;
  8. for(i=1; i<=n; i++)
  9. {
  10. cin>>v[i];
  11. }
  12. for(i=1; i<=n; i++)
  13. {
  14. if(v[i]>max)
  15. {
  16. max=v[i];
  17. pmax=i;
  18. }
  19. }
  20.  
  21. for(i=1; i<=n; i++)
  22. {
  23. if(v[i]<min)
  24. {
  25. min=v[i];
  26. pmin=i;
  27. }
  28. }
  29. if(pmin<pmax)
  30. {
  31. for(i=n; i>=pmax; i--)
  32. {
  33. v[i+1]=v[i];
  34. }
  35. v[pmax+1]=max/2;
  36. n=n+1;
  37. for(i=n; i>=pmin; i--)
  38. {
  39. v[i+1]=v[i];
  40. }
  41. v[pmin+1]=min*2;
  42. n=n+1;
  43. }
  44. else
  45. {
  46. for(i=n; i>=pmin; i--)
  47. {
  48. v[i+1]=v[i];
  49. }
  50. v[pmin+1]=min*2;
  51. n=n+1;
  52. for(i=n; i>=pmax; i--)
  53. {
  54. v[i+1]=v[i];
  55. }
  56. v[pmax+1]=max/2;
  57. n=n+1;
  58. }
  59.  
  60.  
  61.  
  62. for(i=1; i<=n; i++)
  63. {
  64. cout<<v[i]<<" ";
  65. }
  66. return 0;
  67.  
  68.  
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement