Pagini recente » Cod sursa (job #1163206) | Cod sursa (job #2031449) | Cod sursa (job #2835843) | Cod sursa (job #182524) | Cod sursa (job #1528602)
#include <fstream>
#include <set>
using namespace std;
int n, m, i, j, c = 10000, k;
set <int> s;
int v[5000];
int srt[5000];
int f(int x);
int main() {
ifstream in("secv.in");
in >> n;
for (i = 0; i < n; i++) {
in >> v[i];
s.insert(v[i]);
}
c = 0;
for (auto q : s) {
srt[c++] = q;
}
for (i = 0; i < n; i++) {
if (v[i] == srt[0]) {
m = f(i);
if (m < k)
k = m;
}
}
ofstream out("secv.out");
out << k;
in.close();
out.close();
return 0;
}
int f(int x) {
for (k = x, j = 0; j < c; k++) {
if (k = n - 1)
return 10000;
if (v[k] == srt[j])
j++;
}
return k - x + 1;
}