fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5.     const int n=20;  
  6.     int massiv[n], Xmax, Nmax, u;
  7.     std::cout << "{";
  8.     for( int i=0; i<n; i++)
  9.     {
  10.      massiv[i] =u=(std::rand() % 2000)-1000;
  11.         std::cout << massiv[i] << " ";
  12.     }
  13.     std::cout <<"}\n ";
  14.  
  15.     Xmax=massiv[0];
  16.     for (int i=1; i<n;i++)
  17.        Xmax = massiv[i]> Xmax?massiv[i]: Xmax;
  18.  
  19.     std::cout <<"Просто max: "<< Xmax << "\n" ;      
  20.  
  21.     Xmax=massiv[0];
  22.     Nmax = 0;
  23.     for (int i=1; i<n;i++)
  24.        if (massiv[i] > Xmax) //или (massiv[i] > massiv[Nmax])
  25.           {
  26.           	Xmax = massiv[i];
  27.           	Nmax = i;
  28.           }
  29.  
  30.  
  31.     std::cout <<"max value: "<< massiv[Nmax]<< " at index " << Nmax;     
  32.  
  33. 	return 0;
  34. }
Success #stdin #stdout 0s 15232KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
{383 -114 -223 -85 793 -665 386 -508 -351 421 -638 -973 -310 -941 763 926 -460 426 172 736 }
 Просто max: 926
max value: 926 at index 15
https://ideone.com/BzkRSa
language:
C++ (gcc 8.3)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!