Cod sursa(job #892525)
| Utilizator | Data | 26 februarie 2013 10:21:26 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[6000001];
int main()
{
int n,sum,i,sumax,lg=1,poz=1,st=1;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
sum=v[1];
sumax=sum;
for(i=2;i<=n;i++)
{
if(sum<0)
{
sum=v[i];
st=i;
}
else
{
sum=sum+v[i];
if(sum>sumax)
{
sumax=sum;
poz=st;
lg=i-st+1;
}
}
}
g<<sumax<<" "<<poz<<" "<<poz+lg-1;
return 0;
}
