Cod sursa(job #1207441)
Utilizator | Data | 13 iulie 2014 02:45:44 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
long int n,k,v[50005],i,j,st,dr,sum,maxim,l,r;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{ f>>v[i];
if(v[i]>sum+v[i])
{
sum=v[i];st=i;dr=i;
}
else sum+=v[i],dr=i;
if(sum>maxim && dr-st+1>=k)
{
l=st;
r=dr;
maxim=sum;
}
}
g<<l<<" "<<maxim<<" "<<r;
}