Cod sursa(job #631569)
| Utilizator | Data | 8 noiembrie 2011 18:17:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
int v[6000000];
int main()
{
int N,i,j,k,s,maxs,a,b;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>N;
maxs=(int) -2000000000;
for(i=0;i<N;i++)
fin>>v[i];
for(i=0;i<N;i++)
for(j=i;j<N;j++)
{
s=0;
for(k=i;k<=j;k++)
s+=v[k];
if(s>maxs) {maxs=s;a=i;b=j;}
}
fout<<maxs<<" "<<a+1<<" "<<b+1;
fin.close();
fout.close();
return 0;
}
