Cod sursa(job #690904)
| Utilizator | Data | 26 februarie 2012 00:44:56 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, k, i, first, last, begin, a[60000], sum, maxim;
int main()
{
f>>n>>k;
for(i=1; i<=n; ++i) f>>a[i];
begin=1;
for(i=1; i<=n; ++i)
{
if(sum>=0) sum+=a[i];
else if(sum<0)
{
sum=a[i];
begin=i;
}
if(sum>maxim && i-begin+1>=k)
{
maxim=sum;
first=begin;
last=i;
}
}
g<<first<<" "<<last<<" "<<maxim<<"\n";
}
