4 solutions

  • 5
    @ 2025-3-16 15:03:25
    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
    	int n;
    	cin>>n;
    	int maxv,minv;
    	for(int i=1;i<=n;i++)
    	{
    		int x;
    		cin>>x;
    		if(i==1||x>maxv) //第一个或者是当前的分数比已经有的分数更高 
    		{
    			maxv=x; 
    		}
    		if(i==1||x<minv) //第一个或者是当前的分数比已经有的分数更低 
    		{
    			minv=x; 
    		}
    	}
    	cout<<maxv-minv;
    	return 0;
    }
    
    • 1
      @ 2025-7-5 11:51:14
      #include<bits/stdc++.h>
      using namespace std;
      int main()
      {
      	int n;
      	cin>>n;
      	int maxv,minv;
      	for(int i=1;i<=n;i++)
      	{
      		int x;
      		cin>>x;
      		if(i==1||x>maxv)
      		{
      			maxv=x; 
      		}
      		if(i==1||x<minv)
              {
              	minv=x; 
      		}
      	}
      	cout<<maxv-minv;
      	return 0;
      }
      
      • -2
        @ 2024-12-15 16:27:07
        #include<bits/stdc++.h>
        using namespace std;
        int main()
        {
            int n,m;
            cin>>n;
            int maxv,min;
            for(int i=0;i<n;i++)
            {
            	cin>>m;
            	if(i==0)
            	{
            		min=m;
            		maxv=m;
        		}
        		else
        		{
        			if(maxv<m)
        			{
        				maxv=m;
        			}
        			if(min>m)
        			{
        				min=m;
        			}
        		}
        	}
        	cout<<maxv-min;
        	return 0;
        }
        
        • -3
          @ 2024-9-19 19:25:42
          #include <bits/stdc++.h>
          using namespace std;
          int main(){
              int n,m;
              cin >> n;
              int max,min;
              for(int i = 0; i <n;i++){
                  cin >>m;
                  if(i == 0){
                      min = m;
                      max = m;
                  }else{
                      if(max < m){
                          max = m;
                      }
                      if(min > m){
                          min = m;
                      }
                  }
              }
              cout << max - min;
          
          
              return 0;
          }
          
          • 1

          Information

          ID
          874
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          (None)
          # Submissions
          219
          Accepted
          64
          Uploaded By