Cod sursa(job #1709896)

Utilizator UCV_DUMITRU_ENACHE_MITROIUCV DUMITRU MITROI ENACHE UCV_DUMITRU_ENACHE_MITROI Data 28 mai 2016 14:21:18
Problema Twoton Scor 0
Compilator cpp Status done
Runda ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest Marime 0.83 kb
#include <iostream>
#include <limits.h>
#include <stdio.h>
using namespace std;

int w[1000000];
int wc[1000000];

int n;
int a[1000024];

int gener(){
    wc[n-1] = 1;
    w[n-1] = a[n-1];
    for(int i = n - 2; i >= 0; i--){
        wc[i] += 1;

        wc[i] += wc[i+1];
        if(a[i] >= w[i+1]){
            wc[i] += wc[i+1];
            w[i] = w[i+1];
        } else {
            w[i] = a[i];
        }
    }
    return wc[0] % 19997;
}

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]);
    }

    long rez = gener();
//
//    wtf(0);
//cout << rez << " " << count;

    fprintf(fout, "%d\n", rez);

    fclose(fin);
    fclose(fout);

    return 0;
}