Cod sursa(job #1433169)
Utilizator | Data | 9 mai 2015 15:02:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream o("ssm.out");
int main ()
{
int n,i,a,smax=0,s=0,p1,p2,mn,pmn=1;
f>>n; f>>a;
mn=a;
for(i=2;i<=n;i++)
{
s=s+a;
if(s>=smax) {smax=s; p2=i-1;}
else if(s<0) {if(a>mn) {mn=a; pmn=i;} s=0; p1=i;}
f>>a;
}
if(mn<0) o<<mn<<" "<<pmn<<" "<<pmn;
else o<<smax<<" "<<p1<<" "<<p2;
return 0;
}