Cod sursa(job #1461096)
Utilizator | Data | 14 iulie 2015 18:28:23 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
#define MAX 6000001
int N,A[MAX];
int main()
{
int N;
in>>N;
for(int i=1;i<=N;i++)
in>>A[i];
int i,j,max,l=1,r=1,S;
max=A[1];
for(i=1;i<=N;i++)
{
S=0;
for(j=i;j<=N;j++)
{
S+=A[j];
if(S>max)
{
l=i,r=j;
max=S;
}
}
}
out<<max<<" "<<l<<" "<<r;
return 0;
}