Cod sursa(job #700491)
| Utilizator | Data | 1 martie 2012 10:40:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
long long n,i,a[6000000],max,j,c1,c2,s,l;
ifstream f("date.in");
ofstream g("date.out");
max=INT_MIN;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
s=0;
for(l=i;l<=j;l++)
s+=a[l];
if(s>max)
{
max=s;
c1=a[i];
c2=a[j];
}
}
g<<c1<<' '<<c2;
f.close();
g.close();
return 0;
}
