51Nod 1094 前缀和

传送门

解析：二话不说，先前缀和然后O(N^2)暴力求解。也可以再加个set优化。

水题，暴力就完事儿了

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
using namespace std;

#define eps         (1e-6)
#define LL          long long
#define pi          acos(-1.0)
#define ALL(a)      (a.begin(),(a.end())
#define ZERO(a)     memset(a,0,sizeof(a))
#define MINUS(a)    memset(a,0xff,sizeof(a))
#define IOS         cin.tie(0) , cout.sync_with_stdio(0)
#define PRINT(a,b)  cout << "#" << (a) << " " << (b) << endl
#define DEBUG(a,b)  cout << "$" << (a) << " " << (b) << endl
#define line        cout << "\n--------------------\n"

const LL LLINF = 1e18+100;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e4 + 5;
const int MOD = 1e9+7;

int n;
int k;
LL a[MAXN];
LL presum[MAXN];
set<LL> s;
void CONFIRM()
{
    for(int i=1 ;i<=n ;++i)
        PRINT(i, presum[i]);
    line;
}

void INIT()
{
    return;
}

void SOLVE()
{
    ZERO(presum);
    presum[0] = a[0];
    s.insert(a[0]);
    
    for(int i=1; i<=n; ++i){
        presum[i] = presum[i-1] + a[i];
        s.insert(presum[i]);
    }
    
    for(int i=0; i<=n; ++i){
        if(s.count(presum[i]+k))
        for(int j=i+1; j<=n; ++j){
            if(presum[j] - presum[i] == k){
                cout << i+1 << " " << j << endl;
                return;
            }
        }
    }
    puts("No Solution");
}

int main()
{
    IOS;
    cin >> n >> k;
    for(int i=1 ;i<=n; ++i){
        cin >> a[i];
    }
    SOLVE();
    return 0;
}