Cod sursa(job #676925)
Utilizator | Data | 9 februarie 2012 18:28:39 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream>
using namespace std;
long n,k,sum,max1,st=1,sf,in,i,a[50001];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
if(sum<0)
{
sum=a[i];
st=i;
}
else
sum=sum+a[i];
if(max1<sum)
{
sf=i;
in=st;
max1=sum;
}
}
g<<in<<" "<<sf<<" "<<max1;
}