oj.uz

답안 #347073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347073 2021-01-11T16:37:46 Z Nursik Feast (NOI19_feast) C++14
30 / 100
 50 ms 8064 KB 
#include <bits/stdc++.h>
 
#define f first
#define s second
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end() 
#define ld long double
 
using namespace std; 
 
void data() {
	#ifdef NURS
        freopen("main.in", "r", stdin);
        freopen("main.out", "w", stdout);
    #endif	
} 
void win()
{	
	ios_base::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
}
 
int block = 400;
const ld eps = 1e-6; 
 
const int N = 1e6 + 500;
const int mod = 1e9 + 7;
 
const ll hh = 100010683;
const ll hh2 = 150005819;
 
int n, k, g, pos;
ll a[N];
ll s, ans;
ll dp[5000][5000], dp2[5000][5000], pref[5000];
int main()
{
	data();              
	win();        
	cin >> n >> k;
	bool was = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		was = was | (a[i] < 0), s += a[i];
		if (a[i] < 0)
			g++, pos = i;
		pref[i] += pref[i - 1] + a[i];
	}
	//first subtask
	if (was == 0)
	{
		cout << s << '\n';
		return 0;
	}
	//second subtask
	if (g == 1 && k >= 2)
	{
		cout << s - a[pos] << '\n';
		return 0;	
	}
	else if (g == 1 && k == 1)
	{
		ans = max(ans, s);
		s = 0;
		for (int i = 1; i < pos; i++)
			s += a[i];
		ans = max(ans, s), s = 0;
		for (int i = pos + 1; i <= n; i++)
			s += a[i];
		ans = max(ans, s);
		cout << ans << '\n';
		return 0;
	}
	//3 subtask
	ll mn = 0;
	for (int i = 1; i <= n; i++)
	{
		ans = max(ans, pref[i] - mn);
		if (i == 1)
			mn = pref[i];
		else
			mn = min(mn, pref[i]);	
	}
	if (k == 1)
	{
		cout << ans;
		return 0;
	}
	//4, 5 subtasks
	for (int i = 0; i <= n; i++)
	{
		for (int j = 0; j <= k; j++)
		{
			dp[i][j] = -1e9, dp2[i][j] = -1e9;;
		} 
	}
	dp[0][0] = 0, dp2[0][0] = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			dp[i][j] = max(dp[i][j], dp[i - 1][j] + a[i]);
			dp[i][j] = max(dp[i][j], dp2[i - 1][j - 1] + a[i]);
			dp2[i][j] = max(dp2[i - 1][j], dp2[i][j]);
			dp2[i][j] = max(dp2[i][j], dp[i][j]);
			ans = max(ans, dp2[i][j]);
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans;	
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 7672 KB Output is correct
2 Correct 45 ms 7916 KB Output is correct
3 Correct 38 ms 7916 KB Output is correct
4 Correct 37 ms 7936 KB Output is correct
5 Correct 36 ms 7788 KB Output is correct
6 Correct 35 ms 7660 KB Output is correct
7 Correct 36 ms 7660 KB Output is correct
8 Correct 37 ms 7916 KB Output is correct
9 Correct 36 ms 7788 KB Output is correct
10 Correct 37 ms 7788 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 6124 KB Output is correct
2 Correct 25 ms 6252 KB Output is correct
3 Correct 25 ms 5996 KB Output is correct
4 Correct 30 ms 6272 KB Output is correct
5 Correct 36 ms 7660 KB Output is correct
6 Correct 25 ms 5996 KB Output is correct
7 Correct 25 ms 6252 KB Output is correct
8 Correct 37 ms 7916 KB Output is correct
9 Correct 36 ms 7660 KB Output is correct
10 Correct 25 ms 6124 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 8044 KB Output is correct
2 Correct 42 ms 7916 KB Output is correct
3 Correct 42 ms 8044 KB Output is correct
4 Correct 50 ms 7916 KB Output is correct
5 Correct 42 ms 8044 KB Output is correct
6 Correct 44 ms 8044 KB Output is correct
7 Correct 42 ms 8044 KB Output is correct
8 Correct 42 ms 8044 KB Output is correct
9 Correct 46 ms 8064 KB Output is correct
10 Correct 44 ms 8044 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 7672 KB Output is correct
2 Correct 45 ms 7916 KB Output is correct
3 Correct 38 ms 7916 KB Output is correct
4 Correct 37 ms 7936 KB Output is correct
5 Correct 36 ms 7788 KB Output is correct
6 Correct 35 ms 7660 KB Output is correct
7 Correct 36 ms 7660 KB Output is correct
8 Correct 37 ms 7916 KB Output is correct
9 Correct 36 ms 7788 KB Output is correct
10 Correct 37 ms 7788 KB Output is correct
11 Correct 24 ms 6124 KB Output is correct
12 Correct 25 ms 6252 KB Output is correct
13 Correct 25 ms 5996 KB Output is correct
14 Correct 30 ms 6272 KB Output is correct
15 Correct 36 ms 7660 KB Output is correct
16 Correct 25 ms 5996 KB Output is correct
17 Correct 25 ms 6252 KB Output is correct
18 Correct 37 ms 7916 KB Output is correct
19 Correct 36 ms 7660 KB Output is correct
20 Correct 25 ms 6124 KB Output is correct
21 Correct 44 ms 8044 KB Output is correct
22 Correct 42 ms 7916 KB Output is correct
23 Correct 42 ms 8044 KB Output is correct
24 Correct 50 ms 7916 KB Output is correct
25 Correct 42 ms 8044 KB Output is correct
26 Correct 44 ms 8044 KB Output is correct
27 Correct 42 ms 8044 KB Output is correct
28 Correct 42 ms 8044 KB Output is correct
29 Correct 46 ms 8064 KB Output is correct
30 Correct 44 ms 8044 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Incorrect 1 ms 1132 KB Output isn't correct
33 Halted 0 ms 0 KB -