Cod sursa(job #2749176)
| Utilizator | Data | 5 mai 2021 16:49:13 | |
|---|---|---|---|
| Problema | Twoton | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva ICPC | Marime | 0.61 kb |
#include <fstream>
#define MOD 19997
#define NMAX 1000024
#define infile "twoton.in"
#define outfile "twoton.out"
using namespace std;
ifstream f(infile);
ofstream g(outfile);
int n, v[NMAX];
bool isMin;
int main()
{
f >> n;
for (int i = 0; i < n; ++i)
{
f >> v[i];
}
int mini = v[n - 1];
int sol = 1;
for (int i = n - 2; i >= 0; --i)
{
isMin = true;
if (v[i] < mini)
{
mini = v[i];
isMin = false;
}
sol = (1 + sol + sol * isMin) % MOD;
}
g << sol % MOD;
return 0;
}
