Magical GCD UVA - 1642

按照紫书的思路进行分析，逐步加入每一项，加入之后要重新计算变化后的最大公约数的值，然后排序，再比较公约数并且计算对应的MGCD，记录最大的值后输出即可，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

typedef long long LL;

LL gcd(LL a, LL b){
	if (b == 0) return a;
	return gcd(b, a%b);
}

class record{
public:
	LL g;
	int pos;
	record(LL g1 = 0, int p = 0) :g(g1), pos(p){}
};

bool compare(const record& a,const record& b){
	if (a.g != b.g) return a.g < b.g;
	return a.pos < b.pos;
}

int main(){
	int T;
	cin >> T;
	while (T--){
		vector<LL> data;
		int n;
		cin >> n;
		for (int i = 0; i < n; i++){
			LL temp;
			cin >> temp;
			data.push_back(temp);
		}
		LL ans = 0;
		vector<record> Rec;
		for (int i = 0; i < n; i++){
			Rec.push_back(record(0,i));
			for (int j = 0; j < Rec.size(); j++){
				Rec[j].g = gcd(Rec[j].g, data[i]);
			}
			sort(Rec.begin(), Rec.end(), compare);
			vector<record> newRec;
			for (int j = 0; j < Rec.size(); j++){
				if (j == 0 || Rec[j].g != Rec[j - 1].g){
					ans = max(ans, Rec[j].g*(i - Rec[j].pos + 1));
					newRec.push_back(Rec[j]);
				}
			}
			Rec = newRec;
		}
		cout << ans << endl;
	}
	return 0;
}