2 solutions

  • 2
    @ 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-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

      Information

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