Cod sursa(job #973572)
| Utilizator | Data | 14 iulie 2013 19:10:10 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include<fstream>
using namespace std;
int v[6000005];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,maxi,pc,pi,pf,sc;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
maxi=v[1];
sc=v[1];
for(i=2;i<=n;i++)
{
if(sc>0) sc=sc+v[i];
else {sc=v[i];
pc=i;}
if(sc>maxi)
{
maxi=sc;
pi=pc;
pf=i;
}
}
g<<maxi<<" "<<pi<<" "<<pf;
}
