Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #330876)
| Utilizator | Data | 11 iulie 2009 21:00:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include "fstream"
std::ifstream in("ssm.in");
std::ofstream out("ssm.out");
int main ()
{
int i,s,LS=0,LI=0,LSf=0,Lif=0,n,a[100];
in>>n;
for(i=0;i<n;i++)
in>>a[i];
i=0;
int max=a[0];
while(i<n-1)
{ s=a[i];
LI=i;
while(s>0&&i<n-1)
{
i++;
s+=a[i];
LS=i;
if(s>max)
{
Lif=LI;
LSf=LS;
max=s;
}
}
i++;
}
out<<max<<" "<<Lif+1<<" "<<LSf+1<<"\n";
return 0;
}
