Cod sursa(job #2382285)
| Utilizator | Data | 18 martie 2019 00:39:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000001];
long long s,s1;
void citire()
{
f>>n;
for(int i=1;i<=n;i++)f>>a[i];
}int i1=1,i2=1,j1=1;
void dinamica()
{
s=a[1];
for(int i=1;i<=n;i++){
if(s1<0)
{
s1=0;
i2=i;
}
s1+=a[i];
if(s1>s){
s=s1;
i1=i2;
j1=i;
}
}
g<<s<<" "<<i1<<" "<<j1;
}
int main()
{
citire();
dinamica();
return 0;
}
