Cod sursa(job #1579641)
| Utilizator | Data | 24 ianuarie 2016 22:00:45 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int n,i,bestSum=INT_MIN,beg=1,end=1,idx=1,k;
long s,sum=0;
fin>>n>>k;
for(i=1;i<=n;++i)
{
fin>>s;
if(sum<0)
{sum=s; idx=i; }
else sum+=s;
if(bestSum<sum)
{
bestSum=sum; beg=idx; end=i;
}
}
if(end-beg>=k)
fout<<beg<<" "<<end<<" "<<bestSum;
return 0;
}
//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=44
