Pagini recente » Cod sursa (job #2822555) | Cod sursa (job #1108154) | Cod sursa (job #2782698) | Cod sursa (job #3032935) | Cod sursa (job #1710535)
#include <stdio.h>
#include <iostream>
using namespace std;
int n;
int a[1000024];
int count = 0;
int s[1000024],r[1000024];
int wtf(int i)
{
count++;
// c[i] = c[i - 1] + 1;
if (count >= 19997) {
count -= 19997;
}
if (i == n - 1) {
return a[i];
}
if (a[i] < wtf(i + 1)) {
return a[i];
} else {
return wtf(i + 1);
}
// r[i] = r[i - 1] + 1;
}
int main()
{
FILE *fin = fopen("twoton.in", "r");
freopen("twoton.out","w",stdout);
// FILE *fout = fopen("twoton.out", "w");
fscanf(fin, "%d", &n);
for (int i = 0; i < n; ++i) {
fscanf(fin, "%d", &a[i]);
}
s[n - 1] = 1;
r[n - 1] = a[n - 1];
for(int i = n - 2; i >= 0; i--) {
s[i] = (s[i] + s[i + 1] + 1) % 19997;
if(r[i + 1] > a[i])
r[i] = a[i];
else
s[i] = (s[i] + s[i + 1]) % 19997,
r[i] = r[i + 1];
}
// wtf(0);
cout << s[0] << '\n';
// printf("%d\n", count);
fclose(fin);
// fclose(fout);
}