转载华为测试题目

要求如下

#include<stdio.h>#include<stdlib.h>#include<string.h>#define N 30000#define M 500struct student{int num ;int score;};//寻找结构体min-max最高分int sort(struct student stu[], int min, int max){int i,maxscore;for(i=min;i<max;i++){maxscore=stu[min].score;if(maxscore<stu[i].score)maxscore=stu[i].score;}return maxscore;}int fresh(struct student stu[],int a,int b){stu[a].score=stu[b].score;return stu[a].score;}int main(void){//m代表学生数目，n代表操作数目int m,n,l,w;char s;int i,scot,max;printf("please input m:nums of stu and n:nums of opetations\n");scanf("%d %d",&m,&n);struct student a[N];//初始化学生结构体for(i=0;i<m;i++){scanf("%d",&scot);a[i].num=i;a[i].score=scot;}printf("\n");//循环操作次数for(i=0;i<n;i++){printf("please input Q/U l:stu L-stuW\n");scanf("%s %d %d",&s,&l,&w);if(s=='Q'){max=sort(a,l,w);printf("max=%d\n",max);}else if(s=='U')a[l].score=fresh(a,l,w);printf("a[l].score=%d\n",a[l].score);}printf("\n");}