Cod sursa(job #1241066)
Utilizator | Data | 12 octombrie 2014 16:03:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,v[6000001],ppm,upm,sm;
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
}
void ssm()
{
int j=2,a,b,pp,up;
sm=v[1];
pp=1;
up=1;
a=v[1];
while(j<=n)
{
if(v[j]+a<v[j])
{
b=v[j];
pp=j;
up=j;
}
else
{
b=v[j]+a;
up=j;
}
if(b>sm)
{
sm=b;
ppm=pp;
upm=up;
}
j++;
a=b;
}
g<<sm<<" "<<ppm<<" "<<upm;
}
int main()
{
citire();
ssm();
return 0;
}