이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define chmax(x, v) x = max(x, v)
#define chmin(x, v) x = min(x, v)
#define pb push_back
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define x first
#define y second
#define int long long
using namespace std;
 
signed main(){ 
      int nVals; cin >> nVals;
      vector<int> init(nVals), requis(nVals);
      for (int& val : init) cin >> val;
      for (int& val : requis) cin >> val;
      vector<int> dp(nVals + 1, 0);
      int bestRes = -1;
      for (int fin = 0; fin < nVals; ++fin){
            map<int, int> nOccs, nVraisAvant;
            int maxi = -1, sum = 0;
            for (int deb = fin; deb >= 0; --deb){
                  nOccs[requis[deb]]++;
                  nVraisAvant[requis[deb]] += (requis[deb] == init[deb]);
                  sum += (requis[deb] == init[deb]);
                  chmax(maxi, init[deb]);
                  int gainTrans = nOccs[maxi] - sum + nVraisAvant[maxi];
                  chmax(dp[fin + 1], dp[deb] + gainTrans);
            }
            chmax(bestRes, dp[fin + 1]);
          //  chmax(dp[fin])
      }
      cout << bestRes << endl;
      return 0;   
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |