Cod sursa(job #1709108)
Utilizator | UPB-Necula Nitu Muntean SegFaultTigers | Data | 28 mai 2016 10:56:08 |
---|---|---|---|
Problema | Twoton | Scor | 100 |
Compilator | cpp | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.54 kb |
#include<fstream>
#include<vector>
#include<algorithm>
#define N 100100
#define MOD 19997
using namespace std;
ifstream f("twoton.in");
ofstream g("twoton.out");
int n, i,v[N],mini,val;
int main()
{
f >> n;
for(i = 1; i <= n; ++i)
f >> v[i];
val = 1;
mini = v[n];
for(i = n - 1; i; --i)
{
if(v[i] < mini)
val = val + 1;
else
val = val * 2 + 1;
if(val >= MOD)
val -= MOD;
mini = min(mini, v[i]);
}
g << val % MOD << '\n';
return 0;
}