数列极差问题(the problem of sequence biggest difference)

Posted diamondDemand

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了数列极差问题(the problem of sequence biggest difference)相关的知识,希望对你有一定的参考价值。

#include <iostream>
#include <string>
#include <list>  //we use the list  container , because it is easy to sort and get the biggest number and smallest number
using namespace std;

void sequenceBiggestLess(list<int> a, list<int> b)
{
a.sort();
b.sort();
int temp1, temp2;
while(a.size()!=1)
{
//get the biggest number
temp1 = a.front();
a.pop_front();
temp2 = a.front();
a.pop_front();
temp1 = temp1 * temp2 + 1;
a.push_back(temp1);
a.sort();

//get the smallest number
temp1 = b.back();
b.pop_back();
temp2 = b.back();
b.pop_back();
temp1 = temp1 * temp2 + 1;
b.push_back(temp1);
b.sort();
}
temp1 = a.front();
temp2 = b.front();
cout << "biggest value: "<< temp1-temp2;
}


int main()
{
list<int> a, b;
cout << "please input the numbers you wanted to calculate\n enter the number of numbers\n";
int n;
cin >> n;
int temp;
for(int i=0; i<n; i++)
{
cin >> temp;
a.push_back(temp);
b.push_back(temp);
}
sequenceBiggestLess(a, b);
return 0;
}

以上是关于数列极差问题(the problem of sequence biggest difference)的主要内容,如果未能解决你的问题,请参考以下文章

Codeforces Round #500 (Div. 2) C Photo of The Sky

NOIP模拟赛 数列(seq)

数列极差问题-STL优先队列-贪心

「一本通 1.1 练习 1」数列极差

数列极差

zoj 2818 Root of the Problem