Pagini recente » Cod sursa (job #1298720) | Cod sursa (job #2166687) | Cod sursa (job #1145147) | Cod sursa (job #212460) | Cod sursa (job #2141728)
#include <fstream>
#define nmax 100002
#define mod 19997
using namespace std;
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int v[nmax],a[nmax],n;
int wtf(int i)
{
v[i]=1;
if(v[i]>mod)
v[i]-=mod;
if(i==n)
return a[i];
int r=wtf(i+1);
v[i]+=v[i+1];
if(v[i]>mod)
v[i]-=mod;
if(r>a[i])
return a[i];
else
{
v[i]+=v[i+1];
if(v[i]>mod)
v[i]-=mod;
return r;
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
wtf(1);
fout<<v[1];
return 0;
}