Cod sursa(job #272006)
| Utilizator | Data | 6 martie 2009 11:47:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const char in[]="ssm.in";
const char out[]="ssm.out";
const int maxn=6000001;
int main(void)
{
ifstream fin(in);
int n,s,sum=0,maxsum=-6000000,idx=0,end ,begin;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>s;
if(sum<0)
{
sum=s;
idx=i;
}
else
sum+=s;
if(maxsum<sum)
{
maxsum=sum;
begin=idx;
end=i;
}
}
ofstream fout(out);
fout<<maxsum<<' '<<begin<<' '<<end;
return 0;
}