oj.uz

답안 #1096871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096871 2024-10-05T10:05:24 Z Muhammet Bigger segments (IZhO19_segments) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
	int n;
	cin >> n;
	vector <int> a(n+1), p(n+1, 0);
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		p[i] = p[i-1] + a[i];
	}
	vector <vector <int>> v, v1;
	v.resize(n+1);
	v1.resize(n+1);
	for(int i = 1; i <= n; i++){
		long long s = 0;
		for(int j = i-1; j >= 1; j--){
			s += a[j+1];
			int t = upper_bound(v[j].begin(), v[j].end(), s) - v[j].begin();
			if(t != 0){
				v[i].push_back(s);
				v1[i].push_back(v1[j][t-1]+1);
 			}
		}
		s += a[1];
		v[i].push_back(s);
		v1[i].push_back(1);
		for(int j = 1; j < (int)v1[i].size(); j++){
			v1[i][j] = max(v1[i][j],v1[i][j-1]);
		}
	}
	cout << v1[n-1].back()+1;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -