Cod sursa(job #1766076)
Utilizator | Data | 27 septembrie 2016 13:41:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,best,smax=-200000000,x,in,sf,inmax,y;
int main()
{
f>>n; y=0;
for(int i=1;i<=n;i++)
{
f>>x;
best=x;
if(best<=y+x)
best=y+x;
else in=i;
if(smax<best)
{
smax=best;
inmax=in;
sf=i;
}
y=best;
}
g<<smax<<' '<<inmax<<' '<<sf;
return 0;
}