fork download
copy 
  1. #include<iostream>
  2. #include<cstring>
  3. #include<algorithm>
  4.  
  5. using namespace std;
  6.  
  7. #define MAXM 110
  8. #define MAXN 10010
  9. #define INF 0x7fffffff
  10.  
  11. int main() {
  12. 	int n, m, k, a[MAXN], f[MAXN][MAXM];
  13.  
  14.       for (int i = 0; i < n; ++i)
  15.         cin >> a[i];   
  16.       memset(f, 128, sizeof(f));
  17.       for (int i = 0; i <= n; ++i)
  18.         f[i][0]=0;
  19.       for (int i=1; i<=n; ++i)
  20.         for (int j=1; j<=m; ++j) {
  21.             f[i][j] = f[i-1][j];
  22.             if (i >= k) f[i][j] = f[i-k][j-1] + a[i];
  23.             if (j == 1) f[i][j] = f[i-1][j-1] + a[i];
  24.         }
  25.       int max = -INF;
  26.       for (int i=0; i<=n; ++i)
  27.         max = f[i][m];
  28.       cout << max; 
  29.  
  30. 	return 0;
  31. }
Success #stdin #stdout 0s 19456KB
comments (?)
stdin
copy 
4 2 2
3 4 -5 1
stdout
copy 
Standard output is empty
https://ideone.com/MFMdZc
language:
C++ (gcc 8.3)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!