Cod sursa(job #1571799)
Utilizator | Data | 18 ianuarie 2016 15:22:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long x, Max=-(int)(2e9), s=0,p1,p2, n;
int main()
{
in>>n;
p1=p2=1;
for(int i=1;i<=n;i++)
{
in>>x;
s+=x;
if (s<0)
{
s=0;
p1=p2=i+1;
}
if(s>Max)
{
Max=s;
p2=i;
}
}
out<<Max<< " "<<p1 << " "<<p2;
return 0;
}