题解 | #最高分是多少#

#include <algorithm>
#include <vector>
#include <iostream>

using namespace std;

int main()
{
    int N,M;
    while(cin >> N >> M){
        vector<int> grades(N);
        char command;
        int a, b;
        for(int i=0;i<N;++i)
            cin >> grades[i];
        for(int j=0;j<M;++j){
            cin >> command >> a >> b;
            if(c=='Q'){
                if(a>b)
                    swap(a,b);
                cout << *max_element(grades.begin()+a-1,grades.begin()+b)<<endl;                    
            }    
            if(c=='U')
                grades[a-1]=b;         
        }
    }
    return 0;
}