1 solutions
-
-1
C++ :
#include<bits/stdc++.h> using namespace std; long long sum,a[1000001],ans; long long n,k,tmp; int main() { // freopen("1.in","r",stdin); // freopen("1.out","w",stdout); cin>>n>>k; if(k>=n-1) { cout<<0<<endl; return 0; } for(int i=1;i<=n-1;i++) { cin>>a[i]; ans+=a[i]; } for(int i=1;i<=k;i++) tmp+=a[i]; sum=max(tmp,sum); for(int i=1,j=k+1;j<=n-1;i++,j++) { tmp=tmp-a[i]+a[j]; sum=max(sum,tmp); } cout<<ans-sum; return 0; }
- 1
Information
- ID
- 1024
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- (None)
- # Submissions
- 3
- Accepted
- 3
- Uploaded By