# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94917 | karlopuh | Pismo (COCI18_pismo) | C++14 | 1081 ms | 1780 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;
vector < pair<long long int,long long int> > niz; //min i max
long long int n,a,test;
long long int mini=1e9;
int main(){
cin>>n;
for(int j=0;j<n;j++){
cin>>a;
niz.push_back(make_pair(a,a));
for(int i=0;i<j;i++){
if(niz[i].first > a)niz[i].first=a;
if(niz[i].second < a)niz[i].second=a;
test=niz[i].second-niz[i].first;
if(test<mini)mini=test;
}
}
cout<<mini;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |