Cod sursa(job #2343404)
| Utilizator | Data | 13 februarie 2019 22:49:27 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,k,s,smax,indice,inc,sf,ss;
int v[50005];
int main()
{
in>>n>>k;
for (int i = 1; i <= n; ++i)
in>>v[i];
int st = 1;
for(int i = 1;i <= n;i++)
{
if(s < 0)
{
s = v[i];
st = i;
}
else
s += v[i];
if(s > smax && i - st+1 >= k)
{
inc = st;
sf = i;
smax = s;
}
ss += v[i];
}
if (k == n) {out<<1<<" "<<n<<" "<<ss; return 0;}
out<<inc<<" "<<sf<<" "<<smax;
return 0;
}
