Cod sursa(job #1709201)
| Utilizator | Data | 28 mai 2016 11:15:40 | |
|---|---|---|---|
| Problema | Twoton | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.48 kb |
#include <fstream>
#define MaxN 1000024
using namespace std;
int dp[MaxN];
int v[MaxN];
ifstream fin("twoton.in");
ofstream fout("twoton.out");
int main() {
int N;
fin >> N;
for (int i = 0; i < N; ++i)
fin >> v[i];
dp[N - 1] = 1;
for (int i = N - 2; i >= 0; --i) {
dp[i] += dp[i + 1] + 1;
if (v[i] > v[i + 1])
dp[i] += dp[i + 1];
if (dp[i] >= 19997)
dp[i] -= 19997;
}
fout << dp[0] << "\n";
return 0;
}
