oj.uz

답안 #975511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
975511 2024-05-05T11:31:35 Z Nexus 수열 (APIO14_sequence) C++17
50 / 100
 102 ms 3736 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;

const ll N=1e3+9,M=2e18+9,mod=1e9+7;

ll a[N],s[N],dp[N][209],p[N][209],n,k,x,y,z,o=-M;
vector<ll>v;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	
	cin>>n>>k;
	for(ll i=1;i<=n;++i)cin>>a[i];
	
	for(ll i=n;i;--i)s[i]=a[i]+s[i+1];
	
	for(ll i=1;i<n;++i)
	{
		dp[i][1]=(s[1]-s[i+1])*s[i+1],p[i][1]=i;
		if(dp[i][1]>o)o=dp[i][1],z=i;
	}
	
	for(ll j=2;j<=k;++j)
	{
		for(ll i=j;i<=n;++i)
		{
			x=dp[j-1][j-1]+(a[j])*s[i+1],y=j-1;
			for(ll g=j-1;g<i;++g)
			{
				if(dp[g][j-1]+(s[g+1]-s[i+1])*s[i+1]>x)
				x=dp[g][j-1]+(s[g+1]-s[i+1])*s[i+1],y=g;
			}
			dp[i][j]=x,p[i][j]=y;
			if(j==k && x>o)o=x,z=i;
		}
	}
	
	/*
	for(ll i=1;i<=n;++i)
	{
		for(ll j=1;j<=k;++j)
		cout<<dp[i][j]<<' ';
		cout<<'\n';
	}
	*/
	
	cout<<dp[z][k]<<'\n';
	
	x=z;
	for(ll i=k;i;--i)
	{
		v.push_back(x);
		x=p[x][i];
	}
	
	reverse(v.begin(),v.end());
	for(auto i:v)cout<<i<<' ';
	
}

/*
7 3
4 1 3 4 0 2 3

108
1 3 5
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 2652 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 2 ms 2652 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 1 ms 2904 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 2 ms 2652 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 3 ms 2652 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 2 ms 2652 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 2848 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 2652 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 2 ms 2524 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3676 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 2 ms 3676 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 73 ms 3676 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 2 ms 3676 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 102 ms 3672 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 74 ms 3736 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 81 ms 3736 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 76 ms 3676 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 20 ms 3676 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 38 ms 3676 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

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

Subtask #6
0 / 29.0

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