Cod sursa(job #1669123)
| Utilizator | Data | 30 martie 2016 13:12:49 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int s[50001];
int main()
{
int smax,sc,n,i,k,x,pmax,umax,pc;
in>>n>>k;
pmax=pc=1;
for(i=1;i<=k;i++)
{
in>>x;
s[i]=s[i-1]+x;
}
smax=sc=s[k];
umax=k;
for(;i<=n;i++)
{
in>>x;
s[i]=s[i-1]+x;
if(s[i]-s[i-k]>sc+x)
{
sc=s[i]-s[i-k];
pc=i-k+1;
}
else
sc+=x;
if(sc>smax)
{
smax=sc;
umax=i;
pmax=pc;
}
}
out<<pmax<<" "<<umax<<" "<<smax;
return 0;
}
