Cod sursa(job #984173)
| Utilizator | Data | 13 august 2013 18:19:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,i,v[1000];
int begin=1,final,max1,maxf;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++){
if(max1+v[i]>v[i]){
max1=max1+v[i];
final=i;
if(i==n&&v[n]<0){final=final-1;max1=max1+(-v[n]);}
}
else {
max1=v[i];
begin=i;
}
}
g<<begin<<" "<<final<<" "<<max1;
return 0;
}
