제출 #94155

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
94155		MrTEK	Nizin (COCI16_nizin)	C++14	100 / 100	99 ms	12128 KiB

nizin

#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef pair<int,int> ii;

const int N = 1e6 + 5;

int n,a[N];
ll pre[N];

ll get(int l,int r) {
  return pre[r] - pre[l - 1];
}

int f(int l,int r) {
  if (l >= r)
    return 0;
  for (int i = l ; i < r ; i++) {
    ll temp = get(l,i);
    int sl = i + 1, sr = r;
    while(sl < sr) {
      int mid = (sl + sr - 1) / 2;
      if (get(mid,r) > temp)
        sl = mid + 1;
      else
        sr = mid;
    }
    if (get(sl,r) == temp)
      return i - l + r - sl + f(i + 1,sl - 1);
  }
  return r - l;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  cin >> n;
  for (int i = 1 ; i <= n ; i++) {
    cin >> a[i];
    pre[i] = pre[i - 1] + a[i];
  }
  cout << f(1,n);
}

• 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