oj.uz

답안 #601273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601273 2022-07-21T14:34:37 Z jjiangly 수열 (APIO14_sequence) C++14
50 / 100
 189 ms 19572 KB 
//#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#define TASK "QNOI"
#define ll long long
#define f first
#define s second
#define pb push_back
#define For(i,l,r) for (int i=l;i<=r;i++)
#define Fod(i,r,l) for (int i=r;i>=l;i--)
#define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;

typedef pair<int,int> ii;
typedef unsigned long long ull;
const int N = 1000;
const ll oo = 1e15;

ll dp[N + 5][N + 5];
int main () {
	faster;
	

	int n, k;
	cin >> n >> k;

	vector <ll> a(n + 1, 0);
	vector <ll> pre(n + 1, 0);

	For(i, 1, n) cin >> a[i], pre[i] = pre[i - 1] + a[i];

	For(i, 0, N) For(j, 0, N) dp[j][i] = -oo;
	dp[0][0] = 0;

	For(i, 1, n)
		For(j, 1, k) {
			For(l, 0, i - 1)
				dp[i][j] = max(dp[i][j], dp[l][j - 1] + 1ll * (pre[n] - pre[i]) * (pre[i] - pre[l]));
		}

	ll ans = 0;

	For(i, 1, n) ans = max(ans, dp[i][k]);

	cout << ans << endl;

	vector <int> res;

	int cnt = k - 1;

	int tmp = 1;

	For(i, 1, n) {
		if(dp[i][k] == ans) {
			res.pb(i);

			tmp = i;

			Fod(j, i - 1, 1) {
				if(cnt == 0) break;

				if(dp[j][cnt] + 1ll * (pre[n] - pre[tmp]) * (pre[tmp] - pre[j]) == ans) {
					res.pb(j);
					cnt--;
					ans = dp[j][cnt + 1]; 
					tmp = j;
				}
			}
			break;
		}
	}

	reverse(res.begin(), res.end());
	for(int i : res) cout << i << " ";
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8148 KB contestant found the optimal answer: 108 == 108
2 Correct 5 ms 8092 KB contestant found the optimal answer: 999 == 999
3 Correct 5 ms 8148 KB contestant found the optimal answer: 0 == 0
4 Correct 4 ms 8148 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 4 ms 8148 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 4 ms 8148 KB contestant found the optimal answer: 1 == 1
7 Correct 5 ms 8148 KB contestant found the optimal answer: 1 == 1
8 Correct 5 ms 8148 KB contestant found the optimal answer: 1 == 1
9 Correct 4 ms 8196 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 5 ms 8196 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 4 ms 8148 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 5 ms 8148 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 8 ms 8148 KB contestant found the optimal answer: 140072 == 140072
14 Correct 5 ms 8148 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 5 ms 8148 KB contestant found the optimal answer: 805 == 805
16 Correct 5 ms 8148 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 6 ms 8148 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8196 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 5 ms 8148 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 5 ms 8148 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 4 ms 8132 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 4 ms 8136 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 5 ms 8148 KB contestant found the optimal answer: 933702 == 933702
7 Correct 5 ms 8144 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 5 ms 8148 KB contestant found the optimal answer: 687136 == 687136
9 Correct 5 ms 8148 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 5 ms 8148 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8148 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 5 ms 8192 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 11 ms 8148 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 5 ms 8132 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 10 ms 8148 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 10 ms 8204 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 13 ms 8200 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 6 ms 8200 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 6 ms 8148 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 7 ms 8184 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8148 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 8 ms 8212 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 166 ms 8196 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 7 ms 8148 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 177 ms 8248 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 150 ms 8268 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 189 ms 8200 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 182 ms 8216 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 44 ms 8200 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 67 ms 8196 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 16704 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 25 ms 19572 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -