Cod sursa(job #1024050)
Utilizator | Data | 8 noiembrie 2013 02:52:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
int main()
{
long long n,i,s=0,pi1,ps,smx=-30000,x,smn1=30000,smn2=30000,pi2;
ifstream in("ssm.in");
ofstream out("ssm.out");
in>>n;
for (i=1;i<=n;i++)
{
in>>x;
s+=x;
if (s>=smx)
{
smx=s;
ps=i;
pi1=pi2;
smn1=smn2;
}
else if (s<smn2)
{
smn2=s;
pi2=i;
}
}
out<<smx-smn1<<" "<<pi1+1<<" "<<ps;
}