제출 #80037

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80037		pzdba	Doktor (COCI17_doktor)	C++14	100 / 100	314 ms	92652 KiB

doktor

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
int a[500005];
int pref[500005], suff[500005];
vector<pipii> dp[3000005];

int main(){
	int n;
	scanf("%d", &n);
	for(int i=1;i<=n;i++){
		scanf("%d", &a[i]);
		if(i == a[i]) pref[i] = 1;
		pref[i] += pref[i-1];
	}
	for(int i=n;i>=1;i--){
		if(i == a[i]) suff[i] = 1;
		suff[i] += suff[i+1];
	}
	int ans = 0;
	for(int i=1;i<=n;i++){
		int diff = a[i]-i;
		if(diff == 0) ans++;
		int s = 0, e = 0;
		if(diff < 0) s = i+diff, e = i;
		else s = i, e = i+diff;
		int le = e-s+1;
		diff += 2*i;
		diff += 1000000;
		dp[diff].emplace_back(pipii(le, pii(s, e)));
	}
	int st = a[1], en = a[1];
	for(int i=0;i<=3000000;i++){
		int sum = 0;
		sort(dp[i].begin(), dp[i].end());
		for(int j=0;j<dp[i].size();j++){
			int le = dp[i][j].first;
			int s = dp[i][j].second.first;
			int e = dp[i][j].second.second;
			sum++;

			if(ans < sum + pref[s-1] + suff[e+1]){
				ans = sum + pref[s-1] + suff[e+1];
				st = s;
				en = e;
			}
		}
	}
	printf("%d %d\n", a[st], a[en]);
}

컴파일 시 표준 에러 (stderr) 메시지

doktor.cpp: In function 'int main()':
doktor.cpp:37:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<dp[i].size();j++){
               ~^~~~~~~~~~~~~
doktor.cpp:38:8: warning: unused variable 'le' [-Wunused-variable]
    int le = dp[i][j].first;
        ^~
doktor.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
doktor.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

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