Cod sursa(job #1207445)
| Utilizator | Data | 13 iulie 2014 02:51:03 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
long long 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(sum+v[i]<=0)
{
sum=0;st=i+1;dr=i+1;
}
else sum+=v[i],dr=i;
if(sum>maxim && dr-st>=k)
{
l=st;
r=dr;
maxim=sum;
}
}
g<<l<<" "<<r<<" "<<maxim;
f.close();g.close();
}
