Cod sursa(job #547343)
| Utilizator | Data | 6 martie 2011 11:45:34 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000001];
int main() {
int i,j,n,st,end,max=INT_MIN,x,sc;
fin>>n;
for(i=1;i<=n;i++) {
fin>>x;
s[i]=s[i-1]+x;
}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++) {
sc=s[j]-s[i-1];
if(sc>max) { max=sc;st=i;end=j; }
}
fout<<max<<" "<<st<<" "<<end<<"\n";
return 0;
}
