Cod sursa(job #1709567)
Utilizator | Data | 28 mai 2016 12:53:50 | |
---|---|---|---|
Problema | Twoton | Scor | 0 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[100010],n;
long long s=0;
long long x;
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;}
else minim=v[i];
}
s=(s+n)%19997;
g<<s<<'\n';
f.close();
g.close();
return 0;
}