fork download
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4. int n,k,h;
  5. int l,max1;
  6. long long ans;
  7. long long tong=0;
  8. int a[1000001];
  9. int j;
  10. int main()
  11. {
  12. freopen("PHANTHUONG.inp","r",stdin);
  13. freopen("PHANTHUONG.out","w",stdout);
  14.  
  15. cin >> n >> k >> h;
  16. for(int i=1;i<=n;i++)
  17. {
  18. cin >> a[i];
  19. }
  20. if((h>k)&&(k!=1))
  21. {
  22. max1=h/k;
  23. l=max1*2+1;
  24. max1=h-max1*k;
  25. if((max1-1)!=0)
  26. {
  27. if(max1+1==k)
  28. {
  29. l++;
  30. }
  31. if(((max1-1)>(max1+1))&&((max1+1)!=k))
  32. {
  33. l++;
  34. }
  35. }
  36. if((max1-1)==0)
  37. {
  38. if(max1+1==k)
  39. {
  40. l++;
  41. }
  42. }
  43. }
  44. if(k==1)
  45. {
  46. l=h*2+1;
  47. }
  48. if(k==h)
  49. {
  50. l=3;
  51. }
  52. if(k>h)
  53. {
  54. l=1;
  55. }
  56. for(int i=1;i<=l;i++)
  57. {
  58. tong += a[i];
  59. }
  60. ans=tong;
  61. j=l;
  62. int i=1;
  63. while(j<=n)
  64. {
  65. j++;
  66. tong=tong-a[i]+a[j];
  67. i++;
  68. ans=max(ans,tong);
  69. }
  70. cout << ans;
  71. return 0;
  72. }
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Standard output is empty