Notebook/src-bkp/Mo Algorithm - Values in Edges.cpp
void add(int color){
    ff[f[color]]--;
    f[color]++;
    ff[f[color]]++;
    if(f[color] > big){
        big = f[color];
    }
}
//add and remove in this case gets how many times
//appears the most frequent element in a range
add and remove in this case gets how many times
appears the most frequent element in a range
add and remove in this case gets how many times appears the most frequent element in a range
void add(int color){
    ff[f[color]]--;
    f[color]++;
    ff[f[color]]++;
    if(f[color] > big){
        big = f[color];
    }
}
void add ( int color ) { ff [ f [ color ] ] -- ; f [ color ] ++ ; ff [ f [ color ] ] ++ ; if ( f [ color ] > big ) { big = f [ color ] ; } }
add and remove in this case gets how many times
appears the most frequent element in a range
add and remove in this case gets how many times appears the most frequent element in a range