1.https://www.luogu.com.cn/problem/P1652 2.https://www.luogu.com.cn/problem/P1614

代码：

#include<bits/stdc++.h>
using namespace std ;
int dist( int x1 , int y1 , int x2 , int y2 )
{
    return sqrt( ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ) ) ;
}
int main()
{
    int x[60] , y[60] , z[60] , n , x1 , y1 , x2 , y2 , ans = 0 ;
    cin >> n ;
    for( int i = 1 ; i <= n ; i++ )
        cin >> x[i] >> y[i] >> z[i] ;
    cin >> x1 >> y1 >> x2 >> y2 ;
    for( int i = 1 ; i <= n ; i++ )
        if( ( dist( x1 , y1 , x[i] , y[i] ) < z[i] ) ^ ( dist( x2 , y2 , x[i] , y[i] ) < z[i] ) )
            ans++ ;
    cout << ans ;
}

2.
#include<bits/stdc++.h>
using namespace std ;
int main()
{
    int n , m , a[100001] , minn = 100000 , w = 0 ;
    cin >> n >> m ;
    for( int i = 1 ; i <= n ; i++ )
        cin >> a[i] ;
    for( int i = 1 ; i <= n - m + 1 ; i++ )
        {
            for( int j = 1 ; j <= m ; j++ )
                w += a[i + j - 1] ;
            if( w < minn )
                minn = w ;
            w = 0 ;
        }
    cout << w ;
}