Cod sursa(job #1949919)
| Utilizator | Data | 2 aprilie 2017 15:40:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");\
int n,s[6000000],a,mina=INT_MAX,maxa=INT_MIN,st,dr;
int main()
{
fin>>n;
for(int i=1;i<n;i++)
{
fin>>a;
s[i]=s[i-1]+a;
if(s[i]<mina)
{
mina=s[i];
st=i;
}
if(s[i]>maxa)
{
maxa=s[i];
dr=i;
}
}
fout<<s[dr]-s[st-1]<<" "<<st<<" "<<dr;
return 0;
}
