Pagini recente » Cod sursa (job #3187469) | Cod sursa (job #1709368) | Cod sursa (job #2989377) | Cod sursa (job #1636393) | Cod sursa (job #1709602)
#include <iostream>
#include <fstream>
using namespace std;
int v[100010],n;
long long s=0;
long long x=0;
int main()
{
ifstream f ("twoton.in");
ofstream g ("twoton.out");
int i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
int minim=v[n],y=0,suma=0;
for(i=n-1;i>=1;i--)
{
if(v[i]>=minim)
{x=n-i+s;s=s+x;x=x%19997;s=s%19997;}
else minim=v[i];
}
s=(s+n)%19997;
g<<s<<'\n';
f.close();
g.close();
return 0;
}