Submission #1170568

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170568		zrzzrz	Feast (NOI19_feast)	C++20	41 / 100	87 ms	64576 KiB

feast

#include <bits/stdc++.h>
using namespace std;
int n,k,a[300005];
long long f[2005][2005][2];
int main(){
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++) scanf("%d",&a[i]);
	memset(f,0x80,sizeof f);
	f[0][0][0]=0;
	for (int i=1;i<=n;i++) for (int j=0;j<=k;j++){
		f[i][j][0]=max(f[i-1][j][0],f[i-1][j][1]);
		f[i][j][1]=max(f[i-1][j][1],j?f[i-1][j-1][0]:(long long)-1e18)+a[i];
	}
	long long ans=0;
	for (int i=0;i<=k;i++) ans=max({ans,f[n][i][0],f[n][i][1]});
	printf("%lld\n",ans);
	return 0;
}

Compilation message (stderr)

feast.cpp: In function 'int main()':
feast.cpp:6:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |         scanf("%d%d",&n,&k);
      |         ~~~~~^~~~~~~~~~~~~~
feast.cpp:7:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |         for (int i=1;i<=n;i++) scanf("%d",&a[i]);
      |                                ~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 0 / 29