제출 #116900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116900		ntrung03	Doktor (COCI17_doktor)	C++17	10 / 100	602 ms	23656 KiB

doktor

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
int main(int argc, char *argv[]) {
	int n;
	cin>>n;
	vector<int> a(n+1);
	for(int i=1;i<=n;i++) cin>>a[i];
	vector<pair<int,int>> c;//radius, center
	for(int i=1;i<=n;i++){
		int cent = ceil((a[i]+i)/2.0);
		c.push_back({abs(cent-i),cent});
	}
	map<int,pair<int,int>> cc;//center, count,radius
	for(auto c:c){
		auto p = cc[c.second];
		p.first+=1;
		p.second = max(p.second,c.first); 
		cc[c.second] = p;
	}
	auto r = make_pair(1,make_pair(1,0));//count,center,radius
	for(auto c:cc){
		
		r = max(r,make_pair(c.second.first,make_pair(c.first,c.second.second)));
	}
	cout<<a[r.second.first-r.second.second]<<' '<<a[r.second.first+r.second.second];
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10