Pagini recente » Cod sursa (job #160883) | Cod sursa (job #1633354) | Cod sursa (job #2299029) | Cod sursa (job #1762994) | Cod sursa (job #1710677)
#include <cstdio>
#define MOD 19997
#define MAXN 100000
int v[MAXN],d[MAXN][2];
int count = 0,n;
int wtf(int i){
count++;
count%=MOD;
if (i == n - 1){
d[i][0]=v[i];
d[i][1]=1;
return d[i][0];
}
if(d[i+1][0]==0){
int aux=count;
d[i+1][0]=wtf(i+1);
d[i+1][1]=count-aux+MOD;
}
if (v[i] < d[i+1][0])
return v[i];
else{
count+=d[i+1][1];
count%=MOD;
return d[i+1][0];
}
}
int main(){
FILE*fi,*fout;
int i;
fi=fopen("twoton.in" ,"r");
fout=fopen("twoton.out" ,"w");
fscanf(fi,"%d" ,&n);
for(i=0; i<n; i++)
fscanf(fi,"%d" ,&v[i]);
wtf(0);
fprintf(fout,"%d" ,count);
fclose(fi);
fclose(fout);
return 0;
}