제출 #441498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441498		elazarkoren	Exam (eJOI20_exam)	C++17	0 / 100	29 ms	332 KiB

exam

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#define x first
#define y second
//#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int MAX_N = 1e5 + 1;

int a[MAX_N], b[MAX_N];

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    int ans = a[0] == b[0];
    for (int i = 1; i < n; i++) {
        int count = a[i] == b[i];
        int best_count = a[i] == b[i], ind = i;
        for (int j = i - 1; j >= 0; j--) {
            if (a[j] == b[j]) count--;
            if (a[i] == b[j]) count++;
            if (count > best_count) {
                best_count = count;
                ind = j;
            }
        }
        for (int j = i - 1; j >= ind; j--) a[j] = a[i];
        ans += best_count;
    }
    cout << ans;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22