Cod sursa(job #2195627)
| Utilizator | Data | 16 aprilie 2018 21:22:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include<fstream>
using namespace std;
const int N=-2000000000 ;
ifstream f("ssm.in") ;
ofstream g("ssm.out") ;
long long v[6000001] ;
int main()
{
int n,i,maxi=N,in,sf,x=0,p=0 ;
f>>n ;
for(i=1;i<=n;i++) f>>v[i] ;
for(i=1;i<=n;i++)
{
x=x+v[i] ;
if(maxi<x)
{
maxi=x ;
in=p+1 ;
sf=i ;
}
if(x<0)
{
x=0 ;
p=i ;
}
}
g<<maxi<<" "<<in<<" "<<sf ;
}
