Cod sursa(job #2627639)
| Utilizator | Data | 11 iunie 2020 15:55:27 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define N 50000
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int i,n,k,a[N+5],ct=0,p,u;long long S=0,smax=-1000000001;
fin>>n>>k;
for(i=1;i<=n;i++) fin>>a[i];
for(i=1;i<=n;i++)
{
if(S<0) S=a[i],ct=1;
else S+=a[i],ct++;
if(ct>=k && S>smax) smax=S,u=i,p=i-ct+1;
}
fout<<p<<" "<<u<<" "<<smax;
return 0;
}
