Cod sursa(job #1709701)
Utilizator | Data | 28 mai 2016 13:30:43 | |
---|---|---|---|
Problema | Twoton | Scor | 0 |
Compilator | c | Status | done |
Runda | ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest | Marime | 0.45 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *fin = fopen("twoton.in", "r");
FILE *fout = fopen("twoton.out", "w");
int i, n,min ,c,c1,k=0;
fscanf(fin,"%d", &n);
int a[100100];
for(i=0;i<n;i++)
fscanf(fin,"%d", &a[i]);
c=n;
c1=c;
min=a[n-1];
for(i=n-1;i>=0;i--)
{
if(a[i-1]>min)
{
c1=c1+k+n-i;
k=c1-c;
}
else
min=a[i-1];
}
fprintf(fout,"%d",c1 % 19997);
return 0;
}