Cod sursa(job #775904)
Utilizator | Data | 9 august 2012 12:05:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000005];
int main()
{
int p1=1,sc=0,sm=-99999,n,i,p1f,p2f;
f>> n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
if(sc<0){
sc=0;
p1 = i;
}
sc=sc+v[i];
if(sc>sm){
sm=sc;
p1f=p1;
p2f=i;
}
}
g<<sm<<" "<<p1f<<" "<<p2f;
return 0;
}