Submission #1025892

# Submission time Handle Problem Language Result Execution time Memory
1025892 2024-07-17T11:01:57 Z vjudge1 Doktor (COCI17_doktor) C++17
20 / 100
88 ms 11600 KB
#include<bits/stdc++.h>

using namespace std;

int main()
{
  int n;
  cin >> n;
  int a[n], idx[1 + n];
  for(int i = 0; i < n; i ++) {
    cin >> a[i];
    idx[a[i]] = i;
  }

  int cnt[2 * n] = {};
  for(int i = 1; i <= n; i ++)
    cnt[idx[i] + i]++;

  int pref[n + 1];
  for(int i = 0; i < n; i ++) {
    pref[i + 1] = pref[i];
    if(i + 1 == a[i])
      pref[i + 1]++;
  }

  pair<int,int> ans = {1, 1};
  int mx = 0;
  for(int i = 1; i <= n; i ++)
    {
      int j = max(idx[i] + 1, i), k = min(idx[i] + 1, i);
      int profit = cnt[i + idx[i]] - (pref[j] - pref[k]);
      if(profit > mx)
	{
	  mx = profit;
	  ans = {a[k - 1], a[j - 1]};
	}
    }
  
  cout << ans.first << ' ' << ans.second << endl;
  return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 2676 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 11600 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 7064 KB Output isn't correct
2 Halted 0 ms 0 KB -