oj.uz

답안 #134957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134957 2019-07-23T13:23:31 Z wilwxk 수열 (APIO14_sequence) C++14
0 / 100
 2000 ms 36648 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=1e5+5;
const ll INF=1e18;
ll dp[MAXN][205];
int opt[MAXN][205];
ll soma[MAXN];
ll v[MAXN];
int n, x;

int main() {
	scanf("%d %d", &n, &x); x++;
	for(int i=1; i<=n; i++) scanf("%lld", &v[i]);
	for(int i=1; i<=n; i++) soma[i]=soma[i-1], soma[i]+=v[i];

	dp[0][0]=0; for(int i=1; i<=x; i++) dp[0][i]=-INF;
	for(int i=1; i<=n+1; i++) {
		for(int j=1; j<=x; j++) {
			dp[i][j]=dp[i-1][j-1]+v[i];
			opt[i][j]=i-1;

			for(int k=0; k<i; k++) {
				ll val=dp[k][j-1]+(soma[i]-soma[k])*soma[k];
				if(val>=dp[i][j]) {
					dp[i][j]=val;
					opt[i][j]=k;
				}
			}

			// printf("%d %d >> %lld // %d\n", i, j, dp[i][j], opt[i][j]);
		}
	}

	printf("%lld\n", dp[n+1][x]);
	vector<int> respf;
	int ind=n; int k=x-1;
	while(respf.size()<x-1) {
		respf.push_back(opt[ind][k]);
		ind=opt[ind][k--];
	}
	reverse(respf.begin(), respf.end());
	for(auto cur : respf) printf("%d ", cur);
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:39:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(respf.size()<x-1) {
        ~~~~~~~~~~~~^~~~
sequence.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &x); x++;
  ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:15:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=n; i++) scanf("%lld", &v[i]);
                          ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB contestant found the optimal answer: 108 == 108
2 Correct 2 ms 376 KB contestant found the optimal answer: 999 == 999
3 Incorrect 2 ms 380 KB declared answer doesn't correspond to the split scheme: declared = 123, real = 0
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 2 ms 376 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 2 ms 504 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 2 ms 504 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Incorrect 2 ms 504 KB Integer 0 violates the range [1, 49]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 760 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 3 ms 760 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 10 ms 888 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 2 ms 632 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Incorrect 8 ms 764 KB Integer 0 violates the range [1, 199]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 2808 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 7 ms 2808 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 251 ms 2780 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 8 ms 2808 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Incorrect 244 ms 2804 KB Integer 0 violates the range [1, 999]
6 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 883 ms 24596 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 915 ms 24660 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2025 ms 7068 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2054 ms 36648 KB Time limit exceeded
2 Halted 0 ms 0 KB -