-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path363B.cpp
51 lines (45 loc) · 1.08 KB
/
363B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include<bits/stdc++.h>
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi(n) for(ll i=0; i<n; i++)
#define fj(n) for(ll j=0; j<n; j++)
#define fa(n) for(auto i:n)
#define fa2(n) for(auto i:n) cout<<i<<' ';
#define llt ll t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define pb push_back
#define pbx ll xx; cin>> xx; v.pb(xx);
#define pbs string xx; cin>> xx; v.pb(xx);
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define rsortall(x) sort(all(x),greater<ll>())
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/__gcd(a,b)))
#define nl endl;
#define endl "\n"
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define C(x) cout<< x <<endl;
#define F i.first
#define S i.second
using namespace std;
int main(){
ll n,k,sum=0,temp=0; cin>>n>>k;
vll v(n);
fi(n) cin>> v[i];
fi(k) sum+=v[i];
ll mx=sum;
for (int i = 1; i < n-k+1; ++i)
{
sum+=v[i+k-1];
sum-= v[i-1];
if(sum<mx){
mx = min(mx,sum);
temp=i;
}
// cout<<i<<' '<<sum<<nl
}
cout<<temp+1;
}