Cod sursa(job #2166785)
| Utilizator | Data | 13 martie 2018 18:55:24 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[6000001],n,i,s,smax,idx,start,stop,k;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
smax=INT_MIN;
for(i=1;i<=n;i++)
{
s=s+a[i];
if(smax<s&&(i-idx+1)>=k)
{
smax=s;
start=idx;
stop=i;
}
if(s<0)
{
s=0;
idx=i+1;
}
}
g<<start<<" "<<stop<<" "<<smax;
}
