Cod sursa(job #2209028)

Utilizator Horia14Horia Banciu Horia14 Data 1 iunie 2018 15:40:58
Problema Subsir crescator maximal Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include<cstdio>
#define MAX_N 100000
using namespace std;

FILE* fout = fopen("scmax.out","w");
int v[MAX_N], T[MAX_N], R[MAX_N], n, len;

void read() {
    FILE* fin = fopen("scmax.in","r");
    fscanf(fin,"%d",&n);
    for(int i = 0; i < n; i++)
        fscanf(fin,"%d",&v[i]);
    fclose(fin);
}

int binarySearch(int b, int e, int val) {
    int mid, pos = -1;
    while(b <= e && pos == -1) {
        mid = (b + e) >> 1;
        if(v[T[mid]] < val && val <= v[T[mid+1]])
            pos = mid + 1;
        else if(val < v[T[mid]])
            e = mid - 1;
        else b = mid + 1;
    }
    return pos;
}

void SCM() {
    int i, pos;
    len = 0;
    for(i = 0; i < n; i++) {
        T[i] = 0;
        R[i] = -1;
    }
    for(i = 1; i < n; i++) {
        if(v[i] < v[T[0]])
            T[0] = i;
        else if(v[i] > v[T[len]]) {
            len++;
            T[len] = i;
            R[T[len]] = T[len-1];
        } else {
            pos = binarySearch(0,len,v[i]);
            T[pos] = i;
            R[T[pos]] = T[pos-1];
        }
    }
}

void printSCM(int x) {
    if(x != -1) {
        printSCM(R[x]);
        fprintf(fout,"%d ",v[x]);
    }
}

int main() {
    read();
    SCM();
    fprintf(fout,"%d\n",len+1);
    printSCM(T[len]);
    fprintf(fout,"\n");
    fclose(fout);
    return 0;
}