For more algorithm, visit https://github.com/trhgquan/CPP

longestArrays.cpp

/*
 * longestArrays.cpp - Dynamic Programming approach.
 * Code by @trhgquan - https://github.com/trhgquan
 */
int longestArrays(vector<int> a) {
    vector<int> b(a.size(), 1);
    int res = 1;
    for (unsigned i = 1; i < a.size(); ++i){
        if (a[i] >= a[i - 1]) b[i] = b[i - 1] + 1;
        res = max(b[i], res);
    }
    return res;
}