Cod sursa(job #2138753)
Utilizator | Data | 21 februarie 2018 21:00:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,x,s,maxim,p1,p2,q;
int main()
{
f>>n;
maxim=-1000000;
for(int i=1;i<=n;i++)
{
f>>x;
if(s<0)
{
s=x;
q=i;
}
else
s=s+x;
if(s>maxim)
{
maxim=s;
p1=q;
p2=i;
}
}
g<<maxim<<" "<<p1<<" "<<p2;
return 0;
}