Cod sursa(job #1609906)
Utilizator | Data | 23 februarie 2016 09:48:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,s_max,s,st=0,lg=1,poz=0;
fin>>n;
int v[n];
for (int i=0;i<n;i++) fin>>v[i];
s=s_max=v[0];
for (int i=1;i<n;i++)
{
if (s<0)
{
s=v[i],st=i;
}
else
{
s+=v[i];
if (s_max<s) {s_max=s;poz=st;lg=i-st+1;}
}
}
fout<<s_max<<" "<<poz+1<<" "<<poz+lg;
}