Pagini recente » Cod sursa (job #646126) | Cod sursa (job #2893081) | Cod sursa (job #369494) | Cod sursa (job #159210) | Cod sursa (job #2778017)
#include <bits/stdc++.h>
using namespace std;
ifstream in("twoton.in");
ofstream out("twoton.out");
const int NMAX=1000024;
const int MOD=1997;
int n,v[NMAX],s[NMAX];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
s[n]=1;
for(int i=n-1;i>0;i--)
{
s[i]=(s[i+1]+1)%MOD;
if(v[i]>v[i+1]){
s[i]=(s[i]+s[i+1])%MOD;
v[i]=v[i+1];
}
}
out<<s[1];
}
/*#include <stdio.h>
int n;
int a[1000024];
int count = 0;
int wtf(int i)
{
count++;
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);
}
}
int main()
{
FILE *fin = fopen("twoton.in", "r");
FILE *fout = fopen("twoton.out", "w");
fscanf(fin, "%d", &n);
for (int i = 0; i < n; ++i) {
fscanf(fin, "%d", &a[i]);
}
wtf(0);
fprintf(fout, "%d\n", count);
fclose(fin);
fclose(fout);
}
*/