Cod sursa(job #663900)
| Utilizator | Data | 19 ianuarie 2012 09:30:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int a[30002],t[30002];
int main()
{
int N,i,s,j,maxim,st,dr;
ifstream fin("ssm.in");
fin>>N;
s=0;
maxim=a[1],st=1;dr=1;
for (i=1;i<=N;i++)
{
fin>>a[i];
t[i]=t[i-1]+a[i];
}
fin.close();
for (i=1;i<=N;i++)
{
for (j=i;j<=N;j++)
{
s=0;
s=t[j]-t[i-1];
if(s>maxim)
{
maxim=s;
st=i;
dr=j;
}
}
}
ofstream fout("ssm.out");
fout<<maxim<<" "<<st<< " "<<dr;
fout.close();
return 0;
}
