oj.uz

Submission #1107896

# Submission time Handle Problem Language Result Execution time Memory
1107896 2024-11-02T09:47:55 Z alex_2008 Bigger segments (IZhO19_segments) C++14
0 / 100
 1 ms 4432 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#define ff first
#define ss second
typedef long long ll;
using namespace std;
const int N = 5e5 + 10;
ll pref[N];
pair <ll, ll> dp[N];
ll dpp[N];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> pref[i];
		pref[i] += pref[i - 1];
	}
	dp[0] = { 0, 0 };
	dpp[0] = 0;
	for (int i = 1; i <= n; i++) {
		int ind = upper_bound(dpp, dpp + i + 1, pref[i]) - dpp - 1;
		dp[i] = { dp[ind].first + 1, pref[i] - pref[ind] };
		dpp[i] = dp[i].ss + pref[i];
	}
	cout << dp[n].first << "\n";
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4432 KB Output isn't correct
2 Halted 0 ms 0 KB -