Cod sursa(job #1759033)
Utilizator | Data | 18 septembrie 2016 14:03:54 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,i,a,b,k,st,s=-(1<<20),v[50001];
int main()
{
f>>n>>k;
for(i=1;i<=n;++i)
{
f>>v[i];
v[i]+=v[i-1];
if(i>k&&v[i-k]<v[st]) st=i-k;
if(v[i]-v[st]>s)
{
s=v[i]-v[st];
a=st+1;
b=i;
}
}
if(n==k) a=1,b=n,s=v[n];
g<<a<<' '<<b<<' '<<s;
return 0;
}