Cod sursa(job #1107302)
Utilizator | Data | 13 februarie 2014 20:10:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,x;
int i,j,first,last,s;
int bestsum=-6000002;
int best[6000001],a[6000001];
int main()
{
f>>n;
while(n--)
{
i++;
f>>x;
s+=x;
if(s>bestsum)
{
bestsum=s;
first=j;
last=i;
}
if(s<0)
{
s=0;
j=i+1;
}
}
g<<bestsum<<" "<<first<<" "<<last;
return 0;
}