Pagini recente » Cod sursa (job #1668267) | Cod sursa (job #3156997) | Cod sursa (job #2483596) | Cod sursa (job #3184494) | Cod sursa (job #1709901)
#include <stdio.h>
int n;
int a[1000024];
int b[1000024];
int count = 0;
int min;
/*int wtf(int i)
{
count++;
if (count >= 19997) {
count -= 19997;
}
if (i == n - 1) {
return a[i];
}
if (a[i] < wtf(i + 1)) {
return a[i];
} else {
return wtf(i + 1);
}
}*/
void calculate()
{
int suma = 1;
count = 1;
min = a[n-1];
for(int i=n-2; i>=0; i--)
{
if(count>19997)
{
count-=19997;
}
if(a[i]>=min)
{
count += 1+suma;
suma = count;
}
else
{
min = a[i];
count++;
suma++;
}
}
//count +=n;
}
/*
int wtf(int i)
{
count++;
if (count >= 19997) {
count -= 19997;
}
if (i == n - 1) {
return a[i];
}
if (a[i] < wtf(i + 1)) {
return a[i];
} else {
count += aduna();
return min;
}
}
*/
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]);
}
calculate();
fprintf(fout, "%d\n", count);
fclose(fin);
fclose(fout);
}