3 solutions

  • 1
    @ 2026-2-6 9:44:26
    #include <bits/stdc++.h>
    using namespace std;
    const int N=100010;
    int a[N];
    int main()
    {
    	int n;
    	cin>>n;
    	int s=0,sum=100010;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>a[i];
    		s=max(s,a[i]);
    		sum=min(sum,a[i]);
    	} 
    	int q=-10000;
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=i+1;j<=n;j++)
    		{
    			if(a[j]-a[i]>q)
    			{
    				q=a[j]-a[i];
    			}
    		}
    	} 
    	cout<<q;
    	return 0;
    }
    
    • 1
      @ 2026-2-4 10:38:36
      #include<bits/stdc++.h>
      using namespace std;
      int a[11110];
      int main()
      {
          int n;cin>>n;
          int maxv=0,minv=11110;
          for(int i=1;i<=n;i++)
          {
              cin>>a[i];
              maxv=max(maxv,a[i]);
              minv=min(minv,a[i]);
          }
          int q=-10000;
          for(int i=1;i<=n;i++)
          {
              for(int j=i+1;j<=n;j++)
              {
                  if(a[j]-a[i]>q) q=a[j]-a[i];
              }
          }
          cout<<q;
          return 0;
      }
      
      • 0
        @ 2026-9-13 13:39:40
        #include<bits/stdc++.h>
        using namespace std;
            int n;
            int a[1005];
        int main(){
            cin>>n;
            int s=0;
            for(int i=1;i<=n;i++)
            {
                cin>>a[i];
            }    
            for(int j=1;j<=n;j++)
            {
                for(int m=j+1;m<=n;m++)
                {
                    if(a[j]<a[m])
                    {
                        if(a[m]-a[j]>s)
                        {
                            s=a[m]-a[j];
                        }
                    }
                }
            }
            cout<<s;
            return 0;
        }
        
        • 1

        Information

        ID
        3035
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        127
        Accepted
        22
        Uploaded By