7 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;
    }
    
    • 0
      @ 2026-4-12 14:38:13

      #include<bits/stdc++.h> using namespace std; int main() { int a; cin>>a; int c=0;//最大值 int d=1000;//最小值 for(int i=1;i<=a;i++) { int b; cin>>b; if(b<d) { d=b; } else if(b>c) { c=b; } } int z=c-d; cout<<z; return 0; }

      • -1
        @ 2025-11-22 16:13:23
        #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-8-25 15:05:22
          #include<bits/stdc++.h>
          using namespace std;
          int n;
          int main(){
          	cin>>n;
          	int t;
          	int maxn=0,minn=10000000;
          	for(int i=1;i<=n;i++){
          		cin>>t;
          		if(t>maxn){
          			maxn=t;
          		}
          		if(t<minn){
          			minn=t;
          		}
          	}
          	cout<<maxn-minn;
          	
          	return 0;
          }
          
          • -3
            @ 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;
            }
            
            • -6
              @ 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;
              }
              
              • -7
                @ 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
                297
                Accepted
                88
                Uploaded By