| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 146093 | youssan_william | Pismo (COCI18_pismo) | C++14 | 1078 ms | 4524 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll n ;
    cin >> n;
    ll arr[n+1];
    for(int i = 1 ; i <=n ;i++)
        cin >> arr[i];
    ll answer=10000000000 , minimum=10000000000 , maximum=-1 , secMinimum , secMaximum ;
    vector<pair<ll,ll> >maxss,minss;
    for(int i = 1 ; i <= n ;i++)
    {
        maxss.push_back({arr[i],i});
        minss.push_back({arr[i],i});
    }
    sort(minss.begin(),minss.end());
    sort(maxss.begin(),maxss.end());
    reverse(maxss.begin(),maxss.end());
    ll l=1 , r=2;
    for( ;  ; r++)
    {
        if(r>n)
        {
            l++;
            r=l+1;
        }
        if(l>=n)
        {
            break;
        }
        for(int i = 0 ; i < n ;i++)
        {
            if(maxss[i].second<=r&&maxss[i].second>=l)
            {
                maximum=maxss[i].first;
                break;
            }
        }
        for(int i = 0 ; i < n ;i++)
        {
            if(minss[i].second<=r&&minss[i].second>=l)
            {
                minimum=minss[i].first;
                break;
            }
        }
        answer=min(answer,maximum-minimum);
    }
    cout << answer ;
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
