Pagini recente » Cod sursa (job #333488) | Istoria paginii runda/marcel1/clasament | Cod sursa (job #388294) | Cod sursa (job #2142732) | Cod sursa (job #1710807)
#include <stdio.h>
#include <stdlib.h>
int d[100000];
int v[100000];
int main(){
int n, i;
FILE*fi,*fo;
fi=fopen("twoton.in","r");
fo=fopen("twoton.out","w");
fscanf(fi,"%d", &n);
for(i=0;i<n;i++)
fscanf(fi,"%d", &v[i]);
d[n-1]=1;
int min=v[n-1];
for(i=n-2;i>=0;i--){
d[i]=1;
if(v[i]<min)
d[i]+=d[i+1];
else
d[i]+=2*d[i+1];
d[i]%=19997;
if(v[i]<min)
min=v[i];
}
fprintf(fo,"%d", d[0]);
fclose(fi);
fclose(fo);
return 0;
}