Cod sursa(job #451735)
| Utilizator | Data | 9 mai 2010 21:44:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int i,j,n,m,s[7000005],ic,sf,bestsum,s1,k;
int main()
{
ifstream f("smax.in");
ofstream g("smax.out");
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
s1=0;
for(k=i;k<=j;k++)
s1+=s[k];
if(s1>bestsum)
{
bestsum=s1;
ic=i;
sf=j;
}
}
g<<bestsum<<" "<<ic<<" "<<sf;
return 0;
}