Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- for(int cur=nbNombre-1;cur>=0;cur--){
- int *realCur=lower_bound(taille,taille+nbNombre,ori[cur]);
- int n=(int)(realCur-taille);
- int realId=NBF+n;
- int prec=arbre[realId].somme;
- arbre[realId].somme=somme(Seg(ori[cur]-maxDiff,ori[cur]+maxDiff+1),1)+1;
- total=(total+arbre[realId].somme)%9901;
- MAJS(realId/2);
- printf("[%d-%d[ = %d\n",arbre[realId].cur.debut,arbre[realId].cur.fin,arbre[realId].somme);
- }
- printf("%d\n",total-nbNombre);
Add Comment
Please, Sign In to add comment