(2559) 수열

https://www.acmicpc.net/problem/2559

단계별로 풀어보기

22단계(누적 합) 2번째

 

 

 

#include <iostream>
#include <vector>
using namespace std;

int main() 
{
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  
  int n, k;
  
  cin >> n >> k;
  
  vector<int> s(n+1);
  
  for(int k=1;k<=n;k++){
    cin >> s[k];
    s[k]+= s[k-1];
  }
  
  int ans= -10000001;
  
  for(int i=k;i<=n;i++){
    ans= max(ans, s[i]-s[i-k]);
  }
  
  cout << ans;
  
  return 0;
}