Pagini recente » Cod sursa (job #573790) | Cod sursa (job #253206) | Cod sursa (job #1670087) | Cod sursa (job #1570393) | Cod sursa (job #1710387)
#include <stdio.h>
int n;
int a[1000024];
int w[1000024];
int count = 0;
int main()
{
FILE *fin = fopen("twoton.in", "r");
FILE *fout = fopen("twoton.out", "w");
fscanf(fin, "%d", &n);
for (int i = 0; i < n; ++i) {
fscanf(fin, "%d", &a[i]);
}
w[n - 1] = 1;
for (int i = n - 2; i >= 0; i--)
{
if (a[i] < a[i+1])
{
w[i] = w[i + 1] + 1;
w[i] %= 19997;
}
else
{
w[i] = 2 * w[i + 1] + 1;
w[i] %= 19997;
a[i] = a[i + 1];
}
}
fprintf(fout, "%d\n", count);
fclose(fin);
fclose(fout);
}