This paper discusses how to quickly and efficiently search for victims when a disaster occurs. Since the search area is large, the search time of a single UAV will be too long to satisfy the golden window of the search and rescue mission. Therefore, it is necessary to dispatch multiple UAVs to conduct a cooperative search by proposing a multi-UAV area coverage planning under wind fields (MUCPW) algorithm and its variant MUCPW-A to achieve the shortest mission time. It first averagely divides the search area into several regions, formulates equations to calculate the minimum mission time and corresponding energy consumption among all possible area partition methods. As compared to related work, simulation results show that MUCPW and MUCPW-A achieve the shortest mission time and the least energy consumption to search all victims in the search and rescue mission. Further, MUCPW-A achieves the smallest standard deviation in energy consumption.