70,021
社区成员




void find(int st, int ed, int &maxx, int &minn)
{
if(st == ed){
maxx = minn = cow[st];
return;
}
int maxl, maxr, minl, minr, m;
m = (st+ed)/2;
if(st<=m)
find(st, m, maxl, minl);
if(ed >= m+1)
find(m+1, ed, maxr, minr);
maxx = max(maxl, maxr);
minn = min(minl, minr);
}
这个方法会不会效率不够?