0分求调
查看原帖
0分求调
1152121
UzumakiBoruto楼主2023/12/3 14:03

评测记录

#include<cstdio>
#include<algorithm>
using namespace std;
int score[200001];
int query(int first,int last){
	int maxnum=-1;
	for (int i=first; i<=last; i++)
		maxnum=max(score[i],maxnum);
	return maxnum;
}
void change(int id,int score_b){
	if (score[id]<score_b)
		score[id]=score_b;
}
int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	for (int i=1; i<=n; i++) scanf("%d",&score[i]);
	for (int i=1; i<=m; i++){
		char c;
		int a,b;
		scanf("%c %d %d",&c,&a,&b);
		if (c=='Q')
			printf("%d\n",query(a,b));
		else{
			change(a,b);
		}
	}
	return 0;
}
2023/12/3 14:03
加载中...