51Nod 1094 和为k的连续区间

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 using namespace std;
 typedef long long LL;
 const int maxn =  + ;
 int a[maxn];
 LL sum[maxn];

 int main(){
     std::ios::sync_with_stdio(false);
     int n, k;
     cin >> n >> k;
     memset(sum, , sizeof(sum));
     for (int i = ; i <= n; i++){
         cin >> a[i];
         sum[i] = sum[i - ] + a[i];
     }
     bool ok = false;
     for (int i = ; i <= n; i++){        //可能只是自己，所以从0开始
         for (int j = i; j <= n; j++){
             if (sum[j] - sum[i] == k){
                 cout << i+ << " " << j    << endl;        //因为从0开始，所以i需要加1
                 ok = true;
                 break;
             }
         }
         if (ok)
             break;
     }
     if (!ok)
         cout << "No Solution" << endl;
     //system("pause");
     return ;
 }