网易游戏 研发笔试试题
//输入9（第一行）1 2 5 9 4 3 7 8 5（第二行）输出13
#include<iostream>
#include<string>
using namespace std;
#define max_number 100000
int main(int argc,char* argv[]){
int number,index = 0,index_i,index_j;
int a[max_number] = {0};
int max_profit=0, single_profit;
cin>>number;
while(number--){
cin>>a[index++];
}
for(int i=0;i<=index;i++){
for(int j=i+1;j<=index;j++){
for(int k=j+1;k<=index;k++){
for(int m=k+1;m<=index;m++){
single_profit = a[j] - a[i] + a[m] - a[k];
if(max_profit<single_profit){
max_profit = single_profit;
}
}
}
}
}
cout<<max_profit<<endl;
return 0;
}
查看21道真题和解析