Cod sursa(job #1178768)
| Utilizator | Data | 27 aprilie 2014 10:49:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int N,i,mini,rez;
int A,S[6000001];
int BST[6000001];
int pmini,dr;
int main()
{
fi>>N;
S[0]=0;
for (i=1;i<=N;i++)
{
fi>>A;
S[i]=S[i-1]+A;
}
mini=BST[0];
rez=0;
pmini=0;
dr=0;
for (i=1;i<=N;i++)
{
BST[i]=S[i]-mini;
if (BST[i]>rez)
{
rez=BST[i];
dr=i;
}
if (S[i]<mini)
{
mini=S[i];
pmini=i;
}
}
fo<<rez<<" "<<pmini+1<<" "<<dr<<"\n";
fi.close();
fo.close();
}