oj.uz

Submission #385844

# Submission time Handle Problem Language Result Execution time Memory
385844 2021-04-05T05:56:33 Z AdiZer0 Pismo (COCI18_pismo) C++17
70 / 70
 15 ms 1644 KB 
#include <bits/stdc++.h>

#define pb push_back
#define whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = (int)1e5 + 7;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e18 + 1;

int a[N];

int main() {
    int n; scanf ("%d", &n);
    for (int i = 1; i <= n; ++i) scanf ("%d", a + i);
    int ans = INF;
    for (int i = 1; i < n; ++i) { 
        int mx = a[i], mn = a[i]; 
        for (int j = i + 1; j <= n; ++j) { 
           mx = max(mx, a[j]), mn = min(mn, a[j]); 
           if (ans > (mx - mn)) ans = (mx - mn);
           else break;
        }
    }
    printf ("%d\n", ans);
    return 0;
}

Compilation message

pismo.cpp: In function 'int main()':
pismo.cpp:19:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |     int n; scanf ("%d", &n);
      |            ~~~~~~^~~~~~~~~~
pismo.cpp:20:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |     for (int i = 1; i <= n; ++i) scanf ("%d", a + i);
      |                                  ~~~~~~^~~~~~~~~~~~~

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 14 ms 1516 KB Output is correct
6 Correct 15 ms 1644 KB Output is correct
7 Correct 14 ms 1516 KB Output is correct