Cod sursa(job #1151200)
| Utilizator | Data | 23 martie 2014 22:08:57 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,summaxim=-2000000000,sol1,sol2,a[50000];
int main()
{
f >> n >> k;
for(int i=1; i<=n; i++)
{
f >> a[i];
a[i] = a[i-1] + a[i];
}
for(int i=1; i<=n; i++)
{
for(int j=i; j<=n; j++)
{
if(a[j] > summaxim && j-i+1 >= k)
{
summaxim = a[j];
sol1 = i;
sol2 = j;
}
if(i != j) a[j] = a[j] - a[i];
}
}
g << sol1 << " " << sol2 << " " << summaxim << '\n';
g.close();
return 0;
}
