Cod sursa(job #1404965)
Utilizator | Data | 28 martie 2015 18:33:26 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,v[50001],ultima,s,smax,p1,pf;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
smax+=v[i];
}
p1=1;pf=n;
for(int i=1;i<=n;i++)
{
ultima=s=v[i];
for(int j=i+1;j<=n;j++)
{
s=ultima+v[j];
if(smax<s && j-i+1>=k)
{
smax=s;p1=i;pf=j;
}
ultima=s;
}
}
fout<<p1<<' '<<pf<<' '<<smax;
return 0;
}